1 citations · 1 across the 1 of their papers we have counts for
1 paper
Marco Kuhlmann
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.