The following pages link to (Q3517098):
Displaying 18 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)
- Workspace theorems for regular-controlled grammars (Q638524) (← links)
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- The power of programmed grammars with graphs from various classes (Q854407) (← links)
- Simple restriction in context-free rewriting (Q1959430) (← links)
- Generalized forbidding matrix grammars and their membrane computing perspective (Q2055827) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings (Q2864200) (← links)
- Reachability in Petri Nets with Inhibitor Arcs (Q4982097) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity (Q5200099) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
- On the computational completeness of generalized forbidding matrix grammars (Q6496878) (← links)
