Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata

Reference:

Giovanna J. Lavado, Giovanni Pighizzini, and Shinnosuke Seki. Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata. In Proceedings of the 16th International Conference on Developments in Language Theory (DLT 2012, Taipei, Taiwan, August 14-17, 2012), volume 7410 of Lecture Notes in Computer Science, pages 284–295. Springer, 2012.

Suggested BibTeX entry:

@inproceedings{LavadoPighizziniSeki2012,
    author = {Giovanna J. Lavado and Giovanni Pighizzini and Shinnosuke Seki},
    booktitle = {Proceedings of the 16th International Conference on Developments in Language Theory (DLT 2012, Taipei, Taiwan, August 14-17, 2012)},
    language = {eng},
    pages = {284-295},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Converting Nondeterministic Automata and Context-Free Grammars into {P}arikh Equivalent Deterministic Automata},
    volume = {7410},
    year = {2012},
}