Parikh's Theorem: A simple and direct automaton construction

Details Parikh's Theorem: A simple and direct automaton construction Parikh's Theorem: A simple and direct automaton construction

2010-06-19

arxiv.org/abs/1006.3825v3

Computer Science

Formal Languages and Automata Theory

12 pages, 3 figures

Scientific paper

10.1016/j.ipl.2011.03.019

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.

Affiliated with

Also associated with

No associations

Rating

Parikh's Theorem: A simple and direct automaton construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parikh's Theorem: A simple and direct automaton construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parikh's Theorem: A simple and direct automaton construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431258