Small (purely) catalytic P systems simulating register machines
From MaRDI portal
(Redirected from Publication:264529)
Recommendations
- Variants of small universal P systems with catalysts
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- On Pure Catalytic P Systems
- On the power of catalytic P systems with one catalyst
- On the universality of purely catalytic P systems
Cites work
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1951598 (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?)
- Catalytic P systems, semilinear sets, and vector addition systems
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Computing with membranes
- Membrane Computing
- P systems with toxic objects
- Small universal register machines
- Variants of small universal P systems with catalysts
Cited in
(10)- P systems working in maximal variants of the set derivation mode
- How derivation modes and halting conditions may influence the computational power of P systems
- Proof techniques in membrane computing
- The computational power of tissue-like P systems with promoters
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Variants of small universal P systems with catalysts
- Small P systems defining non-semilinear sets
- Computing with a full memory: catalytic space
- On the power of catalytic P systems with one catalyst
This page was built for publication: Small (purely) catalytic P systems simulating register machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264529)
