Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
From MaRDI portal
Publication:3517098
Recommendations
Cited in
(29)- Nonterminal complexity of programmed grammars.
- Simple restriction in context-free rewriting
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- Generalized forbidding matrix grammars and their membrane computing perspective
- On the computational completeness of matrix simple semi-conditional grammars
- A reformulation of matrix graph grammars with Boolean complexes
- Nonterminal complexity of one-sided random context grammars
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- Tissue P systems and (mem)brane systems with mate and drip operations working on strings
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- Scattered context grammars generate any recursively enumerable language with two nonterminals
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- scientific article; zbMATH DE number 1738663 (Why is no real title available?)
- scientific article; zbMATH DE number 1738664 (Why is no real title available?)
- Reachability in Petri nets with inhibitor arcs
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Improved descriptional complexity results on generalized forbidding grammars
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Workspace theorems for regular-controlled grammars
- On the computational completeness of generalized forbidding matrix grammars
- Pareto grammars
- Non-simple rule counting in semi-conditional grammars
- Matrix forbidding grammars
- Star-controlled insertion-deletion systems describing regular closure of linear languages
- Counting simple rules in semi-conditional grammars is not simple
- Nonterminal complexity of tree controlled grammars
- Parsimonious computational completeness
- The power of programmed grammars with graphs from various classes
This page was built for publication: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517098)
