A useful lemma for context-free programmed grammars
From MaRDI portal
Publication:1256864
DOI10.1007/BF00289095zbMath0404.68079WikidataQ124802513 ScholiaQ124802513MaRDI QIDQ1256864
Publication date: 1979
Published in: Acta Informatica (Search for Journal in Brave)
Recursively Enumerable Sets; Context-Free Programmed Languages; Epsilon-Free Programmed Language; Programmed Grammars
DB lookup for MSC labels failed