Shallow Non-confluent P Systems

DOI10.1007/978-3-319-54072-6_19zbMath1483.68124DBLPconf/membrane/LeporatiMMPZ16OpenAlexW2588402022WikidataQ57518205 ScholiaQ57518205MaRDI QIDQ2975921

Alberto Leporati, Claudio Zandron, Antonio E. Porreca, Giancarlo Mauri, Luca Manzoni

Publication date: 12 April 2017

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54072-6_19

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical models of computation (Turing machines, etc.) (68Q04) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (7)

Characterising the complexity of tissue P systems with fission rules ⋮ Active P-colonies ⋮ Bounding the space in P systems with active membranes ⋮ Subroutines in P systems and closure properties of their complexity classes ⋮ Characterizing PSPACE with shallow non-confluent P systems ⋮ P systems attacking hard problems beyond NP: a survey ⋮ A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of membrane systems under tight uniformity conditions
• Non-confluence in divisionless P systems with active membranes
• Membrane computing and complexity theory: A characterization of PSPACE
• Computational complexity of tissue-like P systems
• Complexity classes in models of cellular computing with membranes
• The computational power of cell division in P systems: Beating down parallel computers?
• Tissue P Systems Can be Simulated Efficiently with Counting Oracles
• Membrane Division, Oracles, and the Counting Hierarchy
• Simulating Elementary Active Membranes

This page was built for publication: Shallow Non-confluent P Systems