Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
From MaRDI portal
Publication:2805398
Recommendations
- When catalytic P systems with one catalyst can be computationally complete
- scientific article; zbMATH DE number 7357516
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
- Promoters and inhibitors in purely catalytic P systems
- Catalytic P systems, semilinear sets, and vector addition systems
Cited in
(13)- How derivation modes and halting conditions may influence the computational power of P systems
- scientific article; zbMATH DE number 7357516 (Why is no real title available?)
- Variants of derivation modes for which purely catalytic P systems are computationally complete
- When catalytic P systems with one catalyst can be computationally complete
- Catalytic P systems, semilinear sets, and vector addition systems
- P systems with toxic objects
- Promoters and inhibitors in purely catalytic P systems
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
- Purely Catalytic P Systems over Integers and Their Generative Power
- Variants of small universal P systems with catalysts
- Mathematical Foundations of Computer Science 2003
- On the universality of colored one-catalyst P systems
- On the power of catalytic P systems with one catalyst
This page was built for publication: Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805398)
