Skip to content

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

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

VenueCDLT
Year2012
ProceedingsDevelopments in Language Theory

Browse the full DLT paper archive.