Non-confluence in divisionless P systems with active membranes
From MaRDI portal
Publication:847664
DOI10.1016/j.tcs.2009.07.032zbMath1191.68325WikidataQ57518525 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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Evaluating space measures in 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, Characterizing PSPACE with shallow non-confluent P systems, P systems attacking hard problems beyond NP: a survey, Shallow Non-confluent P Systems, PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item