Deterministic catalytic systems are not universal

DOI10.1016/J.TCS.2006.07.029zbMath1153.68019OpenAlexW1964420136MaRDI QIDQ860859

Hsu-Chun Yen, Oscar H. Ibarra

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.029

zbMATH Keywords

prioritymembrane computingsemilinear setcounter machinedeterministic catalytic systemdeterministic versus nondeterministicsymport/antiport system

Mathematics Subject Classification ID

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

Related Items (5)

Properties of Membrane Systems ⋮ Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems ⋮ Promoters and Inhibitors in Purely Catalytic P Systems ⋮ Using well-structured transition systems to decide divergence for catalytic P systems ⋮ P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH

Cites Work

• Unnamed Item
• 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.
• On the analysis of Petri nets with static priorities
• Developments in Language Theory

This page was built for publication: Deterministic catalytic systems are not universal