Gemmating P systems: Collapsing hierarchies.

DOI10.1016/S0304-3975(02)00657-6zbMATH Open1051.68065DBLPjournals/tcs/BesozziMPZ03OpenAlexW2079716914WikidataQ57518601 ScholiaQ57518601MaRDI QIDQ1401271FDOQ1401271

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

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

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)

Cites Work

• Computing with membranes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Petri net algorithms in the theory of matrix grammars

Cited In (6)

• Membrane Computing
• On the verification of membrane systems with dynamic structure
• The PL Hierarchy Collapses
• Title not available (Why is that?)
• On the power and size of extended gemmating P systems
• OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) 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)