Viliam Geffert. Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. J. Comput. Syst. Sci., 66(3):451-472, 2003. [doi]
@article{Geffert03,
title = {Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions},
author = {Viliam Geffert},
year = {2003},
doi = {10.1016/S0022-0000(03)00036-9},
url = {http://dx.doi.org/10.1016/S0022-0000(03)00036-9},
tags = {translation},
researchr = {https://researchr.org/publication/Geffert03},
cites = {0},
citedby = {0},
journal = {J. Comput. Syst. Sci.},
volume = {66},
number = {3},
pages = {451-472},
}