P systems with active membranes working in polynomial space
DOI10.1142/S0129054111007836zbMATH Open1213.68269DBLPjournals/ijfcs/PorrecaLMZ11WikidataQ57518502 ScholiaQ57518502MaRDI QIDQ3076598FDOQ3076598
Authors: Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron
Publication date: 23 February 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- Title not available (Why is that?)
- Complexity classes in models of cellular computing with membranes
- Complexity classes for membrane systems
- Non-confluence in divisionless P systems with active membranes
Cited In (27)
- A topology for P-systems with active membranes
- Bounding the space in P systems with active membranes
- Alternative space definitions for P systems with active membranes
- Characterizing PSPACE with shallow non-confluent P systems
- Unconventional Computation
- On the universality of P systems with membrane creation
- Further remark on P systems with active membranes and two polarizations
- Coping with dynamical structures for interdisciplinary applications of membrane computing
- Active P-colonies
- On maximal parallel application of rules in rewriting P systems
- Machines, Computations, and Universality
- On a powerful class of non-universal P systems with active membranes
- An efficient simulation of polynomial-space Turing machines by P systems with active membranes
- Title not available (Why is that?)
- Evaluating space measures in P systems
- Space complexity equivalence of P systems with active membranes and Turing machines
- P Systems with Active Membranes Characterize PSPACE
- P systems with active membranes: Trading time for space
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- P Systems with Active Membranes Working in Sublinear Space
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Membrane systems languages are polynomial-time parsable
- Monodirectional P systems
- Sublinear-space P systems with active membranes
- Constant-space P systems with active membranes
- A gap in the space hierarchy of P systems with active membranes
- Shallow non-confluent P systems
This page was built for publication: P systems with active membranes working in polynomial space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076598)