Ogden's Lemma for Regular Tree Languages
Marco Kuhlmann. Ogden's Lemma for Regular Tree Languages. arXiv 0810.4249, 2008.
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.