Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
From MaRDI portal
Publication:2152303
DOI10.1007/S41965-021-00085-ZzbMATH Open1490.68096OpenAlexW3211846577MaRDI QIDQ2152303FDOQ2152303
Authors: Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan 
Publication date: 7 July 2022
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-021-00085-z
Recommendations
- When catalytic P systems with one catalyst can be computationally complete
- scientific article; zbMATH DE number 7357516
- Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
- Variants of small universal P systems with catalysts
- Computationally universal P systems without priorities: Two catalysts are sufficient
Cites Work
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- P Systems with Minimal Left and Right Insertion and Deletion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computationally universal P systems without priorities: Two catalysts are sufficient
- P Systems with Toxic Objects
- Title not available (Why is that?)
- (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode
- Title not available (Why is that?)
- PARTIAL HALTING IN P SYSTEMS
- A Formal Framework for Static (Tissue) P Systems
- Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
- (Tissue) P systems with unit rules and energy assigned to membranes
- Title not available (Why is that?)
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- On Controlled P Systems
- P systems with limited number of objects
- How derivation modes and halting conditions may influence the computational power of P systems
- 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 and Minimal Parallelism Based on Arbitrary Rule Partitions
- Flattening in (Tissue) P Systems
- When catalytic P systems with one catalyst can be computationally complete
- Matter and Anti-Matter in Membrane Systems
- P Systems with Anti-Matter
- Title not available (Why is that?)
- Variants of P systems with activation and blocking of rules
Cited In (2)
This page was built for publication: Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152303)
