Comparisons of Parikh's condition to other conditions for context-free languages

DOI10.1016/S0304-3975(97)00262-4zbMath0902.68101MaRDI QIDQ1128989

J. López-Muñoz, G. Ramos-Jiménez, Rafael Morales-Bueno

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

context-free languagespumping lemmasinterchange conditionParikh's conditionSokolowski's and Grant's condition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The interchange or pump (di)lemmas for context-free languages
• A strong pumping lemma for context-free languages
• A method for proving programming languages non context-free
• An “Interchange Lemma” for Context-Free Languages
• Extensions of sokolowski's theorem to prove languages are not context free or not regular
• A Generalization of Ogden's Lemma
• Comparisons between some pumping conditions for context-free languages
• On Context-Free Languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item