Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.

Christian Hagenah Anca Muscholl

Published in: MFCS (1998)

Keyphrases

regular expressions
deterministic finite automata
pattern matching
query language
finite automata
semistructured data
xml schema
tree automata
regular languages
regular path queries
query evaluation
matching algorithm
worst case
lower bound
string matching
semi automatic
finite state machines
context free grammars