2000 character limit reached
Parikh's Theorem: A simple and direct automaton construction (1006.3825v3)
Published 19 Jun 2010 in cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.