A lower bound on the size of ε-free NFA corresponding to a regular expression.
Yury LifshitsPublished in: Inf. Process. Lett. (2003)
Keyphrases
- regular expressions
- lower bound
- pattern matching
- deterministic finite automata
- semistructured data
- upper bound
- finite automata
- query language
- branch and bound algorithm
- string matching
- xml schema
- regular languages
- query evaluation
- matching algorithm
- regular path queries
- database
- np hard
- graph databases
- static analysis
- low level
- approximate matching
- objective function
- lower and upper bounds
- wordnet