Login / Signup
Obtaining shorter regular expressions from finite-state automata.
Yo-Sub Han
Derick Wood
Published in:
Theor. Comput. Sci. (2007)
Keyphrases
</>
regular expressions
finite state automata
regular languages
finite state machines
pattern matching
finite automata
xml schema
regular path queries
query language
context free grammars
query evaluation
fixpoint
grammatical inference
integrity constraints