A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. We also briefly recall the known bounds for the removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free nondeterministic devices. Moreover,
doi:10.4204/eptcs.151.2
fatcat:xiiyglxcebbkpdklmkngqd47dm