On determinism versus nondeterminism in P systems

DOI10.1016/j.tcs.2005.03.052zbMath1079.68036OpenAlexW2074125075MaRDI QIDQ2575077

Oscar H. Ibarra

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

zbMATH Keywords

molecular computingP systemcounter machinedeterminism versus nondeterminismtwo-way multihead finite automatoncommunicating P systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

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

This page was built for publication: On determinism versus nondeterminism in P systems