5 citations · 12 across the 10 of their papers we have counts for
1 paper · 2 filters
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.