Ogden's Lemma for Regular Tree Languages
Marco Kuhlmann
TL;DR
This paper introduces a strong pumping lemma for regular tree languages, analogous to Ogden's lemma for context-free string languages, providing a new tool for analyzing tree automata.
Contribution
It presents a novel Ogden-like pumping lemma specifically for regular tree languages, expanding theoretical understanding.
Findings
The lemma offers a new method for proving non-regularity of tree languages.
It generalizes existing pumping lemmas for trees.
The result bridges concepts between string and tree language theories.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Machine Learning and Algorithms