Variants of small universal P systems with catalysts
From MaRDI portal
Publication:2805457
Recommendations
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- Small (purely) catalytic P systems simulating register machines
- On Pure Catalytic P Systems
- Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
Cited in
(15)- How derivation modes and halting conditions may influence the computational power of P systems
- The computational power of cell-like P systems with one protein on membrane
- Small (purely) catalytic P systems simulating register machines
- P systems with proteins: a new frontier when membrane division disappears
- The computational power of monodirectional tissue P systems with symport rules
- The computational power of tissue-like P systems with promoters
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Variants of derivation modes for which purely catalytic P systems are computationally complete
- P systems with toxic objects
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- Monodirectional tissue P systems with channel states
- On Pure Catalytic P Systems
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Encoding catalytic P systems in {\(\pi\)}\@
This page was built for publication: Variants of small universal P systems with catalysts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805457)
