Variants of Small Universal P Systems with Catalysts

DOI10.3233/FI-2015-1209zbMath1357.68055OpenAlexW1635487481MaRDI QIDQ2805457

Artiom Alhazov, 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-1209

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Small (purely) catalytic P systems simulating register machines ⋮ The computational power of tissue-like P systems with promoters ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ How derivation modes and halting conditions may influence the computational power of P systems ⋮ P systems with proteins: a new frontier when membrane division disappears ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states

This page was built for publication: Variants of Small Universal P Systems with Catalysts