Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki. Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput., 228:1-15, 2013. [doi]

@article{LavadoPS13,
  title = {Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata},
  author = {Giovanna J. Lavado and Giovanni Pighizzini and Shinnosuke Seki},
  year = {2013},
  doi = {10.1016/j.ic.2013.06.003},
  url = {http://dx.doi.org/10.1016/j.ic.2013.06.003},
  researchr = {https://researchr.org/publication/LavadoPS13},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {228},
  pages = {1-15},
}