The following pages link to (Q3798273):
Displaying 21 items.
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542) (← links)
- Left-forbidding cooperating distributed grammar systems (Q708220) (← links)
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- On the descriptional complexity of scattered context grammars (Q1001907) (← links)
- On a kind of Fatou property of context-free groups (Q1186612) (← links)
- On characterizations of recursively enumerable languages (Q1262786) (← links)
- On three variants of rewriting P systems (Q1399988) (← links)
- Power and size of extended Watson-Crick \(L\) systems. (Q1401185) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- Dynamically controlled cooperating/distributed grammar systems (Q1803860) (← links)
- Homogeneous grammars with a reduced number of non-context-free products (Q1847383) (← links)
- PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- CD Grammar Systems: Competence and Confidence (Q3009337) (← links)
- On the Nonterminal Complexity of Tree Controlled Grammars (Q3166957) (← links)
- Normal forms for phrase-structure grammars (Q3991298) (← links)
- Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts (Q4686650) (← links)
- (Q4988157) (← links)
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity (Q5200099) (← links)
