scientific article
From MaRDI portal
Publication:3798273
zbMath0652.68095MaRDI QIDQ3798273
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
PC grammar systems with five context-free components generate all recursively enumerable languages. ⋮ On the Nonterminal Complexity of Tree Controlled Grammars ⋮ Descriptional complexity of semi-conditional grammars ⋮ Normal forms for phrase-structure grammars ⋮ Unnamed Item ⋮ Scattered context grammars generate any recursively enumerable language with two nonterminals ⋮ On three variants of rewriting P systems ⋮ Power and size of extended Watson-Crick \(L\) systems. ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ On a kind of Fatou property of context-free groups ⋮ CD Grammar Systems: Competence and Confidence ⋮ Parallel communicating grammar systems with context-free components are Turing complete for any communication model ⋮ On the descriptional complexity of some rewriting mechanisms regulated by context conditions ⋮ Left-forbidding cooperating distributed grammar systems ⋮ Nonterminal complexity of tree controlled grammars ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ On the descriptional complexity of scattered context grammars ⋮ Dynamically controlled cooperating/distributed grammar systems ⋮ On characterizations of recursively enumerable languages ⋮ Homogeneous grammars with a reduced number of non-context-free products
This page was built for publication:
