Generalized forbidding matrix grammars and their membrane computing perspective
From MaRDI portal
Publication:2055827
DOI10.1007/978-3-030-77102-7_3OpenAlexW3170097976MaRDI QIDQ2055827
Lakshmanan Kuppusamy, Henning Fernau, Indhumathi Raman
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77102-7_3
computational completenessmatrix grammarsdescriptional complexity\textsf{P} systemsgeneralized forbidding grammars
Related Items (1)
Cites Work
- A variant of random context grammars: Semi-conditional grammars
- Petri net algorithms in the theory of matrix grammars
- On three variants of rewriting P systems
- Nonterminal complexity of programmed grammars.
- Membrane systems with promoters/inhibitors
- Computing with membranes
- On path-controlled insertion-deletion systems
- On the power of generalized forbidding insertion-deletion systems
- Descriptional complexity of semi-conditional grammars
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- Generalized forbidding grammars
- Normal forms for phrase-structure grammars
- Descriptional Complexity Of Generalized Forbidding Grammars
- Improved descriptional complexity results on generalized forbidding grammars
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized forbidding matrix grammars and their membrane computing perspective
