Generalized forbidding matrix grammars and their membrane computing perspective
type: Item
instance of: scholarly article
title: Generalized forbidding matrix grammars and their membrane computing perspective
DOI: 10.1007/978-3-030-77102-7_3
author: Henning Fernau
author: Lakshmanan Kuppusamy
author: Indhumathi Raman
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q07
zbMATH DE Number: 7437061
zbMATH Keywords: generalized forbidding grammars
zbMATH Keywords: matrix grammars
zbMATH Keywords: computational completeness
zbMATH Keywords: descriptional complexity
zbMATH Keywords: \textsf{P} systems
MaRDI profile type: Publication
full work available at URL: 978-3-030-77102-7 3
OpenAlex ID: W3170097976
cites work: Q4738302
cites work: Membrane systems with promoters/inhibitors
cites work: Q4040325
cites work: Nonterminal complexity of programmed grammars.
cites work: Q3517098
cites work: Improved descriptional complexity results on generalized forbidding grammars
cites work: On path-controlled insertion-deletion systems
cites work: On the power of generalized forbidding insertion-deletion systems
cites work: On three variants of rewriting P systems
cites work: Q4530001
cites work: Normal forms for phrase-structure grammars
cites work: Petri net algorithms in the theory of matrix grammars
cites work: Q5313795
cites work: Descriptional complexity of semi-conditional grammars
cites work: Generalized forbidding grammars
cites work: Descriptional Complexity Of Generalized Forbidding Grammars
cites work: Six nonterminals are enough for generating each r.e. language by a matrix grammar
cites work: A variant of random context grammars: Semi-conditional grammars
cites work: Computing with membranes
description: scientific article; zbMATH DE number 7437061