Pages that link to "Item:Q1401269"
From MaRDI portal
The following pages link to Nonterminal complexity of programmed grammars. (Q1401269):
Displayed 14 items.
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← 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)
- 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)
- One-Sided Random Context Grammars with Leftmost Derivations (Q3166950) (← 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)