On three variants of rewriting P systems

DOI10.1016/S0304-3975(02)00581-9zbMath1023.68059WikidataQ57518603 ScholiaQ57518603MaRDI QIDQ1399988

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

Publication date: 30 July 2003

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

zbMATH Keywords

systemsChomsky hierarchymembrane computingregulated rewritingLindenmayer

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

One-Sided Random Context Grammars with Leftmost Derivations ⋮ P Systems with Parallel Rewriting for Chain Code Picture Languages ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Language generating alphabetic flat splicing P systems ⋮ An Overview of 2D Picture Array Generating Models Based on Membrane Computing ⋮ Contextual array grammars and array P systems ⋮ Rewriting P systems: improved hierarchies ⋮ Generalized forbidding matrix grammars and their membrane computing perspective

Cites Work

• Petri net algorithms in the theory of matrix grammars
• Computing with membranes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item