An efficient simulation of polynomial-space Turing machines by P systems with active membranes
From MaRDI portal
Publication:5851925
DOI10.1007/978-3-642-11467-0_31zbMATH Open1273.68138DBLPconf/membrane/ValsecchiPLMZ09OpenAlexW1883842167WikidataQ57518512 ScholiaQ57518512MaRDI QIDQ5851925FDOQ5851925
Alberto Leporati, Antonio E. Porreca, Andrea Valsecchi, Giancarlo Mauri, Claudio Zandron
Publication date: 26 January 2010
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11467-0_31
Recommendations
- A gap in the space hierarchy of P systems with active membranes
- Simulating Turing machines with polarizationless P systems with active membranes
- Space complexity equivalence of P systems with active membranes and Turing machines
- P systems with active membranes working in polynomial space
- Constant-space P systems with active membranes
Cited In (9)
- P systems attacking hard problems beyond NP: a survey
- P Systems Simulating Oracle Computations
- Subroutines in P systems and closure properties of their complexity classes
- Non-confluence in divisionless P systems with active membranes
- A Prolog simulator for deterministic P systems with active membranes
- Evaluating space measures in P systems
- Space complexity equivalence of P systems with active membranes and Turing machines
- Title not available (Why is that?)
- Selected Topics in Computational Complexity of Membrane Systems
This page was built for publication: An efficient simulation of polynomial-space Turing machines by P systems with active membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5851925)
