Ogden Property for Linear Displacement Context-Free Grammars

DOI10.1007/978-3-319-27683-0_26zbMath1474.68167OpenAlexW2397966221MaRDI QIDQ5283441

Alexey Sorokin

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_26

zbMATH Keywords

counterexamplespumping lemmalimit Ogden lemmalinear discontinuous context-free languagesOgden lemma

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Ogden's lemma, multiple context-free grammars, and the control language hierarchy

Cites Work

• Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
• Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• Pumping lemmas for the control language hierarchy
• Monoid Automata for Displacement Context-Free Languages
• A helpful result for proving inherent ambiguity

This page was built for publication: Ogden Property for Linear Displacement Context-Free Grammars