Decidability of termination problems for sequential P systems with active membranes

DOI10.1007/978-3-319-20028-6_24MaRDI QIDQ3195702zbMATH OpenOpenAlexFDO

Authors Michal Kováč

Publication date 20 October 2015

Published in Evolving Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-20028-6_24

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• On the computational power of 1-deterministic and sequential P systems
• On a powerful class of non-universal P systems with active membranes
• ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
• Automata, Languages and Programming

Cites work

• Computing and Combinatorics
• Computing with membranes
• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• Membrane Computing
• Properties of membrane systems

Cited in

(2)

• A Prolog simulator for deterministic P systems with active membranes
• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

This page was built for publication: Decidability of termination problems for sequential P systems with active membranes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195702)