On determinism versus nondeterminism in P systems
From MaRDI portal
Publication:2575077
DOI10.1016/j.tcs.2005.03.052zbMath1079.68036MaRDI QIDQ2575077
Publication date: 5 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.052
molecular computing; P system; counter machine; determinism versus nondeterminism; two-way multihead finite automaton; communicating P systems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems, On Bounded Symport/Antiport P Systems
Cites Work
- The power of communication: P systems with symport/antiport
- Computing with membranes
- Computationally universal P systems without priorities: Two catalysts are sufficient
- A guide to membrane computing.
- Membrane computing. An introduction.
- Relationships between nondeterministic and deterministic tape complexities
- A note on multihead automata and context-sensitive languages
- Membrane Computing