Publication:3798273
From MaRDI portal
zbMath0652.68095MaRDI QIDQ3798273
Publication date: 1988
68Q45: Formal languages and automata
Related Items
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity, Scattered context grammars generate any recursively enumerable language with two nonterminals, Language classes generated by tree controlled grammars with bounded nonterminal complexity, Left-forbidding cooperating distributed grammar systems, Nonterminal complexity of tree controlled grammars, On the descriptional complexity of scattered context grammars, On a kind of Fatou property of context-free groups, On characterizations of recursively enumerable languages, On three variants of rewriting P systems, Power and size of extended Watson-Crick \(L\) systems., On the descriptional complexity of some rewriting mechanisms regulated by context conditions, Dynamically controlled cooperating/distributed grammar systems, Homogeneous grammars with a reduced number of non-context-free products, PC grammar systems with five context-free components generate all recursively enumerable languages., Descriptional complexity of semi-conditional grammars, CD Grammar Systems: Competence and Confidence, On the Nonterminal Complexity of Tree Controlled Grammars, Normal forms for phrase-structure grammars
