Tissue P Systems Can be Simulated Efficiently with Counting Oracles

DOI10.1007/978-3-319-28475-0_17zbMath1473.68084OpenAlexW2294245900WikidataQ57518322 ScholiaQ57518322MaRDI QIDQ2789138

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

Publication date: 26 February 2016

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

Full work available at URL: http://hdl.handle.net/10281/107102

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Classical models of computation (Turing machines, etc.) (68Q04) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (4)

Characterising the complexity of tissue P systems with fission rules ⋮ The counting power of P systems with antimatter ⋮ Shallow Non-confluent P Systems ⋮ Shallow laconic P-systems can count

This page was built for publication: Tissue P Systems Can be Simulated Efficiently with Counting Oracles