2000 character limit reached
Ogden's Lemma for Regular Tree Languages (0810.4249v1)
Published 23 Oct 2008 in cs.CC
Abstract: 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.