From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity.
Hermann GruberMarkus HolzerPublished in: Int. J. Found. Comput. Sci. (2015)
Keyphrases
- finite automata
- regular expressions
- pattern matching
- tree automata
- query language
- xml schema
- regular path queries
- regular languages
- query evaluation
- finite automaton
- matching algorithm
- deterministic finite automata
- conjunctive regular path queries
- databases
- finite state machines
- decision problems
- graph databases
- query containment
- protein sequences
- database systems