P systems with active membranes: Trading time for space

DOI10.1007/S11047-010-9189-XzbMath1214.68162DBLPjournals/nc/PorrecaLMZ11OpenAlexW2073445594WikidataQ57518503 ScholiaQ57518503MaRDI QIDQ537818

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

Publication date: 23 May 2011

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

Full work available at URL: https://doi.org/10.1007/s11047-010-9189-x

zbMATH Keywords

computational complexitymembrane computingregister machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Polymorphic P Systems with Non-cooperative Rules and No Ingredients ⋮ Active P-colonies ⋮ Evaluating space measures in P systems ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ Bounding the space in P systems with active membranes ⋮ Alternative space definitions for P systems with active membranes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of cell division in P systems: Beating down parallel computers?
• Computing with membranes
• From regulated rewriting to computing with membranes: collapsing hierarchies
• Membrane Computing
• Membrane Computing
• Aspects of Molecular Computing

This page was built for publication: P systems with active membranes: Trading time for space