Shallow laconic P-systems can count

DOI10.1007/S41965-020-00032-4zbMath1469.68045OpenAlexW3008847732MaRDI QIDQ1983024

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

Publication date: 14 September 2021

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

Full work available at URL: https://doi.org/10.1007/s41965-020-00032-4

zbMATH Keywords

countinglaconic P-systemssend-in rulesshallow P-systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (5)

Evaluating space measures in P systems ⋮ Bounding the space in P systems with active membranes ⋮ Modeling diel vertical migration with membrane computing ⋮ Alternative space definitions for P systems with active membranes ⋮ Proof techniques in membrane computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of membrane systems under tight uniformity conditions
• The counting power of P systems with antimatter
• Monodirectional P systems
• Tissue P Systems Can be Simulated Efficiently with Counting Oracles
• PP is as Hard as the Polynomial-Time Hierarchy
• Simulating Elementary Active Membranes

This page was built for publication: Shallow laconic P-systems can count