A note on the sufficiency of Sokolowski's criterion for context-free languages

DOI10.1016/0020-0190(82)90016-3zbMath0494.68075OpenAlexW2097823921MaRDI QIDQ1169297

Anton Nijholt

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-note-on-the-sufficiency-of-sokolowskis-criterion-for-contextfree-languages(56d21d97-f1cb-4023-a04e-1b7f33783291).html

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On satisfying the LL-iteration theorem ⋮ Comparisons between some pumping conditions for context-free languages ⋮ On context-free and Szilard languages

Cites Work

• Unnamed Item
• Unnamed Item
• A strong pumping lemma for context-free languages
• A method for proving programming languages non context-free
• A helpful result for proving inherent ambiguity