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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.