Parikh's Theorem: A simple and direct automaton construction
Formal Languages and Automata Theory
2012-07-03 v3
Abstract
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language.
Cite
@article{arxiv.1006.3825,
title = {Parikh's Theorem: A simple and direct automaton construction},
author = {Javier Esparza and Pierre Ganty and Stefan Kiefer and Michael Luttenberger},
journal= {arXiv preprint arXiv:1006.3825},
year = {2012}
}
Comments
12 pages, 3 figures