P Systems with Toxic Objects

DOI10.1007/978-3-319-14370-5_7zbMath1457.68090OpenAlexW103200324MaRDI QIDQ3454885

Artiom Alhazov, Rudolf Freund

Publication date: 2 December 2015

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-14370-5_7

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items

Small (purely) catalytic P systems simulating register machines, Variants of derivation modes for which purely catalytic P systems are computationally complete, When catalytic P systems with one catalyst can be computationally complete, Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete, Small Universal Devices, Extended spiking neural P systems with white hole rules and their red-green variants, P Systems Working in Maximal Variants of the Set Derivation Mode, P systems with limited number of objects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization strategies for maximally parallel multiset rewriting systems
• P systems without multiplicities of symbol-objects
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Membrane computing. An introduction.
• Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness
• FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS
• On symport/antiport P systems with a small number of objects
• Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN
• Small P Systems Defining Non-semilinear Sets
• Membrane Systems Using Noncooperative Rules with Unconditional Halting
• Flattening in (Tissue) P Systems
• Machines, Computations, and Universality