Extensions of sokolowski's theorem to prove languages are not context free or not regular

DOI10.1080/00207168208803309zbMath0494.68076OpenAlexW2038743525MaRDI QIDQ3957965

Philip W. Grant

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1080/00207168208803309

zbMATH Keywords

context-free languagepumping lemmanecessary conditionnon-context- freeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

The interchange or pump (di)lemmas for context-free languages ⋮ Comparisons of Parikh's condition to other conditions for context-free languages ⋮ Comparisons between some pumping conditions for context-free languages

Cites Work

• A method for proving programming languages non context-free
• Unnamed Item

This page was built for publication: Extensions of sokolowski's theorem to prove languages are not context free or not regular