ON REGULAR EXPRESSION HASHING TO REDUCE FA SIZE
From MaRDI portal
Publication:3655538
DOI10.1142/S0129054109007042zbMath1187.68293MaRDI QIDQ3655538
Wikus Coetser, Derrick G. Kourie, Bruce W. Watson
Publication date: 8 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
DFA; minimization; equivalence classes; regular languages; finite state automaton; hash function; NFA; state merging; exact automaton; super-automaton
68Q45: Formal languages and automata
22E46: Semisimple Lie groups and their representations
53C35: Differential geometry of symmetric spaces
57S20: Noncompact Lie groups of transformations
Cites Work