Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness

DOI10.3233/FI-2015-1144zbMath1357.68057OpenAlexW1709935975MaRDI QIDQ2805398

Marion Oswald, Gheorghe Păun, Rudolf Freund

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1144

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Variants of derivation modes for which purely catalytic P systems are computationally complete ⋮ P Systems with Toxic Objects ⋮ 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 ⋮ How derivation modes and halting conditions may influence the computational power of P systems

This page was built for publication: Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness