P systems with limited number of objects

DOI10.1007/s41965-020-00068-6zbMath1469.68014OpenAlexW3135070171MaRDI QIDQ1982995

Rudolf Freund, Sergiu Ivanov, Artiom Alhazov

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-00068-6

zbMATH Keywords

computational completenessP-systemslimited number of objectspartially blind register machines

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (4)

Variants of derivation modes for which purely catalytic P systems are computationally complete ⋮ Turing completeness of water computing ⋮ Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete ⋮ A key agreement protocol based on spiking neural P systems with anti-spikes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• P systems without multiplicities of symbol-objects
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Membrane computing. An introduction.
• On the Power of Catalytic P Systems with One Catalyst
• Membrane division, restricted membrane creation and object complexity in P systems
• P Systems with Toxic Objects
• Length P Systems

This page was built for publication: P systems with limited number of objects