The Tape Comilexity of Some Classes of Szilard Languages
From MaRDI portal
Publication:4133164
DOI10.1137/0206032zbMath0357.68092MaRDI QIDQ4133164
No author found.
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206032
Related Items
A useful lemma for context-free programmed grammars, On some derivation mechanisms and the complexity of their Szilard languages, On the extension of Gladkij's theorem and the hierarchies of languages, On the Complexity of Szilard Languages of Regulated Grammars