Nonterminal complexity of programmed grammars
From MaRDI portal
Recommendations
- Nonterminal complexity of programmed grammars.
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- On the nonterminal complexity of tree controlled grammars
Cited in
(17)- Nonterminal complexity of programmed grammars.
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Non-perturbative graph languages, halting problem and complexity
- Nonterminal complexity of one-sided random context grammars
- Derivational complexity of context-free grammars
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- scientific article; zbMATH DE number 4203730 (Why is no real title available?)
- Programmed grammars with rule queues
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
- On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- scientific article; zbMATH DE number 6606360 (Why is no real title available?)
- Star-controlled insertion-deletion systems describing regular closure of linear languages
- Nonterminal complexity of tree controlled grammars
- Parsimonious computational completeness
- Programmed grammars and their relation to the LBA problem
This page was built for publication: Nonterminal complexity of programmed grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530000)
