On the power and size of extended gemmating P systems

DOI10.1007/S00500-004-0394-3MaRDI QIDQ2576607zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniela Besozzi, Erzsébet Csuhaj-Varjú, Claudio Zandron, Giancarlo Mauri

Publication date 13 December 2005

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-004-0394-3

zbMATH Keywords

Geffert normal formgemmationmembrane computingrecursively enumerable language

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Membrane Computing
• OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS
• Gemmating P systems: Collapsing hierarchies.
• scientific article; zbMATH DE number 2044498
• Logical Approaches to Computational Barriers

Cites work

• Gemmating P systems: Collapsing hierarchies.
• scientific article; zbMATH DE number 2044498 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)

Cited in

(6)

• Power and size of extended Watson-Crick L systems.
• Gemmating P systems: Collapsing hierarchies.
• Purely Catalytic P Systems over Integers and Their Generative Power
• scientific article; zbMATH DE number 2044498 (Why is no real title available?)
• Membrane Computing
• OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS

This page was built for publication: On the power and size of extended gemmating P systems

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