Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
From MaRDI portal
Publication:2152303
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
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 193524 (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?)
- (Tissue) P systems with unit rules and energy assigned to membranes
- (Tissue) P systems with vesicles of multisets
- (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode
- 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 minimal left and right insertion and deletion
- 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
- Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- Variants of P systems with activation and blocking of rules
- When catalytic P systems with one catalyst can be computationally complete
Cited in
(6)- Variants of derivation modes for which purely catalytic P systems are computationally complete
- When catalytic P systems with one catalyst can be computationally complete
- scientific article; zbMATH DE number 7357516 (Why is no real title available?)
- P systems working in maximal variants of the set derivation mode
- Encoding catalytic P systems in {\(\pi\)}\@
- Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness
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)
