CORR
2010
Springer
14 years 17 days ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...