Translation of binary regular expressions into nondeterministic ε-free automata with transitions.
Viliam GeffertPublished in: J. Comput. Syst. Sci. (2003)
Keyphrases
- regular expressions
- finite automata
- tree automata
- pattern matching
- query language
- regular languages
- finite automaton
- semistructured data
- matching algorithm
- deterministic finite automata
- xml schema
- finite state machines
- regular path queries
- finite state
- context free grammars
- computational complexity
- graph databases
- query evaluation
- domain knowledge