On the computational power of 1-deterministic and sequential P systems

MaRDI QIDQ3409984zbMATH OpenFDO

Authors Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang

Publication date 21 November 2006

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS
• ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
• Membrane Computing
• On determinism versus nondeterminism in P systems

Cited in

(11)

• Sequential P systems with regular control
• How derivation modes and halting conditions may influence the computational power of P systems
• ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS
• Computing and Combinatorics
• Computation power of asynchronous spiking neural P systems with polarizations
• Decidability of termination problems for sequential P systems with active membranes
• Membrane Computing
• Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN
• On determinism versus nondeterminism in P systems
• Developments in Language Theory
• P SYSTEMS WORKING IN THE SEQUENTIAL MODE ON ARRAYS AND STRINGS

This page was built for publication: On the computational power of 1-deterministic and sequential \(P\) systems

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