Parikh's theorem: A simple and direct automaton construction

  • Authors:

  • Javier Esparza;Pierre Ganty;Stefan Kiefer;Michael Luttenberger

  • Affiliations:

  • Institut für Informatik, Technische Universität München, 85748 Garching, Germany;The IMDEA Software Institute, Madrid, Spain;Oxford University Computing Laboratory, Oxford, UK;Institut für Informatik, Technische Universität München, 85748 Garching, Germany

  • Venue:
  • Information Processing Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.89

Visualization

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.