Gemmating P systems: Collapsing hierarchies.

DOI10.1016/S0304-3975(02)00657-6zbMath1051.68065DBLPjournals/tcs/BesozziMPZ03OpenAlexW2079716914WikidataQ57518601 ScholiaQ57518601MaRDI QIDQ1401271

Claudio Zandron, Giancarlo Mauri, Gheorghe Păun, Daniela Besozzi

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00657-6

zbMATH Keywords

UniversalityMembrane computingMatrix grammarRecursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

On the verification of membrane systems with dynamic structure ⋮ OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS ⋮ On the power and size of extended gemmating P systems

Cites Work

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

This page was built for publication: Gemmating P systems: Collapsing hierarchies.