| Article ID: | iaor20114470 |
| Volume: | 111 |
| Issue: | 12 |
| Start Page Number: | 614 |
| End Page Number: | 619 |
| Publication Date: | Jun 2011 |
| Journal: | Information Processing Letters |
| Authors: | Esparza Javier, Ganty Pierre, Kiefer Stefan, Luttenberger Michael |
| Keywords: | software engineering |
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.