Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions

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

Authors

Viliam Geffert

This author has not been identified. Look up 'Viliam Geffert' in Google