The counting power of P systems with antimatter

DOI10.1016/j.tcs.2017.03.045zbMath1382.68076OpenAlexW2606182744WikidataQ57518138 ScholiaQ57518138MaRDI QIDQ1682865

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

Publication date: 6 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.045

zbMATH Keywords

computational complexitymembrane computingP systems with active membranesP systems with antimatter

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

A Turing machine simulation by P systems without charges ⋮ Simulating counting oracles with cooperation ⋮ Shallow laconic P-systems can count ⋮ Subroutines in P systems and closure properties of their complexity classes ⋮ Characterizing PSPACE with shallow non-confluent P systems ⋮ Depth-two P systems can simulate Turing machines with \textbf{NP} oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of membrane systems under tight uniformity conditions
• Membrane computing and complexity theory: A characterization of PSPACE
• Monodirectional P systems
• Tissue P Systems Can be Simulated Efficiently with Counting Oracles
• Membrane Division, Oracles, and the Counting Hierarchy
• Computational efficiency of dissolution rules in membrane systems
• Simulating Elementary Active Membranes
• Antimatter as a Frontier of Tractability in Membrane Computing

This page was built for publication: The counting power of P systems with antimatter