Tissue P systems can be simulated efficiently with counting oracles

DOI10.1007/978-3-319-28475-0_17MaRDI QIDQ2789138zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

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

Recommendations

• Characterising the complexity of tissue P systems with fission rules
• P systems simulating oracle computations
• Simulating counting oracles with cooperation
• Efficient simulation of tissue-like P systems by transition cell-like P systems
• Membrane division, oracles, and the counting hierarchy

Cited in

(7)

• The counting power of P systems with antimatter
• Shallow laconic P-systems can count
• Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
• Characterising the complexity of tissue P systems with fission rules
• Efficient simulation of tissue-like P systems by transition cell-like P systems
• P systems simulating oracle computations
• Shallow non-confluent P systems

This page was built for publication: Tissue P systems can be simulated efficiently with counting oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789138)