Non-confluence in divisionless P systems with active membranes

DOI10.1016/J.TCS.2009.07.032zbMath1191.68325DBLPjournals/tcs/PorrecaMZ10OpenAlexW1986226635WikidataQ57518525 ScholiaQ57518525MaRDI QIDQ847664

Giancarlo Mauri, Claudio Zandron, Antonio E. Porreca

Publication date: 19 February 2010

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.032

zbMATH Keywords

complexity theorymembrane computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Evaluating space measures in P systems ⋮ Shallow Non-confluent P Systems ⋮ Bounding the space in P systems with active membranes ⋮ Alternative space definitions for P systems with active membranes ⋮ Time-free solution to SAT problem by tissue P systems ⋮ PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE ⋮ Characterizing PSPACE with shallow non-confluent P systems ⋮ P systems attacking hard problems beyond NP: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of membrane systems
• Membrane computing and complexity theory: A characterization of PSPACE
• Complexity classes in models of cellular computing with membranes
• The computational power of cell division in P systems: Beating down parallel computers?
• Computing with membranes
• Membrane computing. An introduction.
• Complexity classes for membrane systems
• Unconventional Computation
• An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes
• Aspects of Molecular Computing

This page was built for publication: Non-confluence in divisionless P systems with active membranes