A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES

DOI10.1142/S0129054107005340zbMath1183.68346OpenAlexW2107166068WikidataQ61677522 ScholiaQ61677522MaRDI QIDQ3401478

Enzo Magalini, Giovanni Pighizzini

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1142/s0129054107005340

zbMATH Keywords

context-free grammarsformal languagespumping Lemma

Mathematics Subject Classification ID

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

Related Items (1)

Formal grammars for turn-bounded deterministic context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pumping lemma for deterministic context-free languages
• Two iteration theorems for some families of languages
• A strong pumping lemma for context-free languages
• Finite-Turn Pushdown Automata
• A helpful result for proving inherent ambiguity

This page was built for publication: A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES