Tight Bounds on the Descriptional Complexity of Regular Expressions.
Hermann GruberMarkus HolzerPublished in: Developments in Language Theory (2009)
Keyphrases
- regular expressions
- tight bounds
- upper bound
- pattern matching
- finite automata
- semistructured data
- query language
- tree automata
- xml schema
- conjunctive regular path queries
- deterministic finite automata
- query evaluation
- lower bound
- graph databases
- finite state machines
- database systems
- regular languages
- regular path queries
- database
- computational complexity
- conjunctive queries
- data exchange
- decision problems
- databases