Gemmating P systems: Collapsing hierarchies.

DOI10.1016/S0304-3975(02)00657-6MaRDI QIDQ1401271zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

Membrane computingMatrix grammarRecursively enumerable languagesUniversality

Mathematics Subject Classification ID

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

Recommendations

• On the power and size of extended gemmating P systems
• Membrane Computing
• scientific article; zbMATH DE number 2044498
• Computing with membranes: One more collapsing hierarchy
• OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 2044498 (Why is no real title available?)
• scientific article; zbMATH DE number 1543318 (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?)
• Computing with membranes
• Petri net algorithms in the theory of matrix grammars

Cited in

(6)

• OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS
• Membrane Computing
• On the verification of membrane systems with dynamic structure
• scientific article; zbMATH DE number 2044498 (Why is no real title available?)
• The PL Hierarchy Collapses
• On the power and size of extended gemmating P systems

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

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