Variants of derivation modes for which purely catalytic P systems are computationally complete

DOI10.1016/J.TCS.2022.03.007MaRDI QIDQ2139058zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald

Publication date 17 May 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

computational completenesscatalystsderivation modespurely catalytic P systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
• When catalytic P systems with one catalyst can be computationally complete
• Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
• Variants of small universal P systems with catalysts
• scientific article; zbMATH DE number 7357516

Cites work

• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 1951586 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 7357516 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A Formal Framework for Static (Tissue) P Systems
• Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Computing with membranes
• Flattening in (tissue) P systems
• How derivation modes and halting conditions may influence the computational power of P systems
• Matter and anti-matter in membrane systems
• Membrane computing. An introduction.
• On Controlled P Systems
• On the power of catalytic P systems with one catalyst
• P systems with anti-matter
• P systems with limited number of objects
• P systems with toxic objects
• P systems working in maximal variants of the set derivation mode
• PARTIAL HALTING IN P SYSTEMS
• Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
• Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
• When catalytic P systems with one catalyst can be computationally complete

Cited in

(4)

• Membrane creation and symport/antiport rules solving QSAT
• A general neural membrane computing model
• scientific article; zbMATH DE number 7357516 (Why is no real title available?)
• Encoding catalytic P systems in {\(\pi\)}\@

This page was built for publication: Variants of derivation modes for which purely catalytic P systems are computationally complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139058)