Ogden's Lemma for Regular Tree Languages

Details Ogden's Lemma for Regular Tree Languages Ogden's Lemma for Regular Tree Languages

2008-10-23

arxiv.org/abs/0810.4249v1

Computer Science

Computational Complexity

Scientific paper

We motivate and prove a strong pumping lemma for regular tree languages. The
new lemma can be seen as the natural correspondent of Ogden's lemma for
context-free string languages.

Affiliated with

Also associated with

No associations

Rating

Ogden's Lemma for Regular Tree Languages 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 Ogden's Lemma for Regular Tree Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ogden's Lemma for Regular Tree Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680724