P systems with limited number of objects
From MaRDI portal
Publication:1982995
Recommendations
Cites work
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Computing with membranes
- Length P systems
- Membrane computing. An introduction.
- Membrane division, restricted membrane creation and object complexity in P systems
- On the power of catalytic P systems with one catalyst
- P systems with toxic objects
- P systems without multiplicities of symbol-objects
Cited in
(5)- Variants of derivation modes for which purely catalytic P systems are computationally complete
- A key agreement protocol based on spiking neural P systems with anti-spikes
- Turing completeness of water computing
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
- P SYSTEMS WITH SINGLE PASSENGER CARRIERS
This page was built for publication: P systems with limited number of objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982995)