On the descriptional complexity of scattered context grammars
From MaRDI portal
Publication:1001907
DOI10.1016/j.tcs.2008.10.017zbMath1161.68022MaRDI QIDQ1001907
Publication date: 19 February 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.017
Related Items
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete, Scattered context grammars generate any recursively enumerable language with two nonterminals, Nonterminal complexity of one-sided random context grammars
Cites Work