Provably Shorter Regular Expressions from Finite Automata.

Hermann Gruber Markus Holzer

Published in: Int. J. Found. Comput. Sci. (2013)

Keyphrases

regular expressions
finite automata
pattern matching
query language
regular languages
matching algorithm
xml schema
tree automata
deterministic finite automata
finite state machines
regular path queries
query evaluation
graph databases
finite automaton
data mining
building blocks