Pages that link to "Item:Q3347322"
From MaRDI portal
The following pages link to Six nonterminals are enough for generating each r.e. language by a matrix grammar (Q3347322):
Displayed 12 items.
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Nonterminal complexity of programmed grammars. (Q1401269) (← links)
- A guide to membrane computing. (Q1853480) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- Generalized forbidding matrix grammars and their membrane computing perspective (Q2055827) (← links)
- (Q3740261) (← links)
- (Q4301686) (← links)
- Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages (Q4375397) (← links)
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity (Q5200099) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)