Parikh's Theorem: A simple and direct automaton construction
classification
💻 cs.FL
keywords
languageparikhcontext-freeautomatonconstructionimageregularsimple
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.