Ogden's Lemma for Regular Tree Languages
classification
💻 cs.CC
keywords
lemmalanguagesogdenregulartreecontext-freecorrespondentmotivate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.