On three variants of rewriting P systems

DOI10.1016/S0304-3975(02)00581-9MaRDI QIDQ1399988zbMATH OpenDBLPWikidataFDO

Authors Claudio Ferretti, Giancarlo Mauri, Claudio Zandron, Gheorghe Păun

Publication date 30 July 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00581-9

zbMATH Keywords

Chomsky hierarchyLindenmayermembrane computingregulated rewritingsystems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Hierarchies of parallel rewriting P systems -- a survey
• scientific article; zbMATH DE number 6694449
• A note on parallel rewriting in P systems
• scientific article; zbMATH DE number 1951594
• scientific article; zbMATH DE number 2087502

Cites work

• Computing with membranes
• Computing with membranes: One more collapsing hierarchy
• scientific article; zbMATH DE number 4064526 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1740165 (Why is no real title available?)
• scientific article; zbMATH DE number 1740167 (Why is no real title available?)
• scientific article; zbMATH DE number 1738664 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087502 (Why is no real title available?)
• Petri net algorithms in the theory of matrix grammars
• String-objects in P systems

Cited in

(23)

• Rewriting systems over similarity and generalized pseudometric spaces and their properties
• Rewriting P systems: improved hierarchies
• Generalized forbidding matrix grammars and their membrane computing perspective
• The computational power of enzymatic numerical P systems working in the sequential mode
• Language generating alphabetic flat splicing P systems
• A note on parallel rewriting in P systems
• Bridging deterministic P systems and conditional grammars
• Rewriting P systems with flat-splicing rules
• scientific article; zbMATH DE number 992013 (Why is no real title available?)
• One-sided random context grammars with leftmost derivations
• P systems with parallel rewriting for chain code picture languages
• scientific article; zbMATH DE number 1735641 (Why is no real title available?)
• scientific article; zbMATH DE number 1740167 (Why is no real title available?)
• scientific article; zbMATH DE number 1951594 (Why is no real title available?)
• scientific article; zbMATH DE number 1738659 (Why is no real title available?)
• scientific article; zbMATH DE number 2182433 (Why is no real title available?)
• scientific article; zbMATH DE number 2087502 (Why is no real title available?)
• Contextual array grammars and array P systems
• An overview of 2D picture array generating models based on membrane computing
• PROBABILISTIC REWRITING P SYSTEMS
• Logical string rewriting
• Rewriting system of certain semigroups with three generators
• On maximal parallel application of rules in rewriting P systems

This page was built for publication: On three variants of rewriting P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399988)