Viliam Geffert. Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. J. Comput. Syst. Sci., 66(3):451-472, 2003. [doi]
No references recorded for this publication.
No citations of this publication recorded.