Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
From MaRDI portal
Publication:3123354
DOI10.1080/00207169708804552zbMath0865.68075OpenAlexW2074869001MaRDI QIDQ3123354
Publication date: 6 March 1997
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169708804552
Related Items (6)
Prefix pushdown automata and their simplification ⋮ Middle quotients of linear languages ⋮ On the degree of scattered context-sensitivity. ⋮ Nonterminal complexity of programmed grammars. ⋮ On the descriptional complexity of some rewriting mechanisms regulated by context conditions ⋮ Terminating left-hand sides of scattered context productions M. Nivat
Cites Work
This page was built for publication: Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages