A useful lemma for context-free programmed grammars

DOI10.1007/BF00289095zbMath0404.68079OpenAlexW2161999806WikidataQ124802513 ScholiaQ124802513MaRDI QIDQ1256864

Jan van Leeuwen

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289095

zbMATH Keywords

Recursively Enumerable SetsContext-Free Programmed LanguagesEpsilon-Free Programmed LanguageProgrammed Grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• The Tape Comilexity of Some Classes of Szilard Languages
• Turing machines with restricted memory access
• Programmed Grammars and Classes of Formal Languages
• Quasi-realtime languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item