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]

Authors

Giovanna J. Lavado

This author has not been identified. Look up 'Giovanna J. Lavado' in Google

Giovanni Pighizzini

This author has not been identified. Look up 'Giovanni Pighizzini' in Google

Shinnosuke Seki

This author has not been identified. Look up 'Shinnosuke Seki' in Google