Variants of derivation modes for which purely catalytic P systems are computationally complete
From MaRDI portal
Publication:2139058
DOI10.1016/J.TCS.2022.03.007OpenAlexW4221035977MaRDI QIDQ2139058
Sergiu Ivanov, Marion Oswald, Artiom Alhazov, Rudolf Freund
Publication date: 17 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.007
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing with membranes
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Membrane computing. An introduction.
- P systems with limited number of objects
- How derivation modes and halting conditions may influence the computational power of P systems
- When catalytic P systems with one catalyst can be computationally complete
- On the Power of Catalytic P Systems with One Catalyst
- Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness
- P Systems Working in Maximal Variants of the Set Derivation Mode
- PARTIAL HALTING IN P SYSTEMS
- P Systems with Toxic Objects
- Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
- Flattening in (Tissue) P Systems
- On Controlled P Systems
- A Formal Framework for Static (Tissue) P Systems
- Matter and Anti-Matter in Membrane Systems
- P Systems with Anti-Matter
This page was built for publication: Variants of derivation modes for which purely catalytic P systems are computationally complete
