Login / Signup
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
Juraj Hromkovic
Sebastian Seibert
Thomas Wilke
Published in:
STACS (1997)
Keyphrases
</>
finite automata
regular expressions
pattern matching
deterministic automata
tree automata
query language
finite automaton
regular languages
xml schema
regular path queries
finite state machines
deterministic finite automata
hidden markov models
markov chain
context free grammars