Converting Nondeterministic Automata and Context-free Grammars into Parikh Equivalent One-way and Two-way Deterministic Automata (2013)
AUTHORS:
Lavado Giovanna,
Pighizzini Giovanni,
Seki Shinnosuke
JOURNAL:
Information and Computation
VOLUME:
228
PAGES:
1-15
@article{ LavadoPighizziniSeki2013, author = "Lavado, Giovanna and Pighizzini, Giovanni and Seki, Shinnosuke", responsibleauthor = "Seki, Shinnosuke", isbn = "", language = "eng", title = "Converting Nondeterministic Automata and Context-free Grammars into {P}arikh Equivalent One-way and Two-way Deterministic Automata", country = "USA", journal = "Information and Computation", issn = "0890-5401", number = "NA", volume = "228", timestamp = "2013.11.14", juforank = "3", il = "yes", year = "2013", owner = "sseki", unitcode = "T306-99,T312-1", kay = "NA", impactfactor = "A1", pages = "1-15", flags = "copy" }