Ogden's Lemma for Regular Tree Languages
Computational Complexity
2008-10-24 v1
Authors:
Marco Kuhlmann
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.
Cite
@article{arxiv.0810.4249,
title = {Ogden's Lemma for Regular Tree Languages},
author = {Marco Kuhlmann},
journal= {arXiv preprint arXiv:0810.4249},
year = {2008}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Pumping lemma and Ogden lemma for displacement context-free grammars
Alexey Sorokin
2014-07-01
Formal Languages and Automata Theory · Computer Science
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
Antoine Amarilli, Marc Jeanmougin
2013-07-09
Formal Languages and Automata Theory · Computer Science
Pumping Lemma for Higher-order Languages
Kazuyuki Asada, Naoki Kobayashi
2017-05-31
Formal Languages and Automata Theory · Computer Science
Pumping lemmas for linear and nonlinear context-free languages
Géza Horváth, Benedek Nagy
2010-12-02
Computational Complexity · Computer Science
Swapping Lemmas for Regular and Context-Free Languages
Tomoyuki Yamakami
2009-03-05
Formal Languages and Automata Theory · Computer Science
A short survey around the pumping lemma for context-free languages
Gabriele Gullà
2024-03-26
Formal Languages and Automata Theory · Computer Science
A substitution lemma for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel, Mengfan Lyu
2026-05-26
Formal Languages and Automata Theory · Computer Science
A pumping-like lemma for languages over infinite alphabets
Yoav Danieli
2025-12-30
Formal Languages and Automata Theory · Computer Science
Construction of rational expression from tree automata using a generalization of Arden's Lemma
Younes Guellouma, Ludovic Mignot, Hadda Cherroun, Djelloul Ziadi
2015-02-02
Formal Languages and Automata Theory · Computer Science
Formalization of the pumping lemma for context-free languages
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2015-10-19
Formal Languages and Automata Theory · Computer Science
Regularity of languages generated by non context-free grammars over a singleton terminal alphabet
Alberto Pettorossi, Maurizio Proietti
2018-07-13
Formal Languages and Automata Theory · Computer Science
Pumping lemmas for classes of languages generated by folding systems
Jorge C. Lucero
2022-05-12
Formal Languages and Automata Theory · Computer Science
Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings
Andreas Maletti, Nils Oskar Nuernbergk
2023-09-07
Formal Languages and Automata Theory · Computer Science
Ordered Context-Free Grammars Revisited
Brink van der Merwe
2023-09-19
Data Structures and Algorithms · Computer Science
On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
2023-07-20
Logic in Computer Science · Computer Science
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
Anupam Das, Abhishek De
2024-04-26
Logic in Computer Science · Computer Science
Model Checking Parse Trees
Anudhyan Boral, Sylvain Schmitz
2013-08-23
Formal Languages and Automata Theory · Computer Science
Piecewise testable tree languages
Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing
2015-07-01
Formal Languages and Automata Theory · Computer Science
Multiple Context-Free Tree Grammars: Lexicalization and Characterization
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2017-07-13
Computation and Language · Computer Science
Tree-Planted Transformers: Unidirectional Transformer Language Models with Implicit Syntactic Supervision
Ryo Yoshida, Taiga Someya, Yohei Oseki
2025-08-20
Formal Languages and Automata Theory · Computer Science
Solving of Regular Equations Revisited (extended version)
Martin Sulzmann, Kenny Zhuo Ming Lu
2019-08-13
Machine Learning · Computer Science
Mathematical Reasoning via Self-supervised Skip-tree Training
Markus N. Rabe, Dennis Lee, Kshitij Bansal, Christian Szegedy
2020-08-13
Computational Complexity · Computer Science
A New Approach to Formal Language Theory by Kolmogorov Complexity
Ming Li, Paul Vitanyi
2007-05-23
Formal Languages and Automata Theory · Computer Science
Asymptotic Approximation by Regular Languages
Ryoma Sin'ya
2020-11-18
Formal Languages and Automata Theory · Computer Science
Anti-Context-Free languages
Carles Cardó
2024-01-17