Sequential and maximally parallel multiset rewriting: reversibility and determinism

DOI10.1007/S11047-011-9267-8zbMath1251.68100OpenAlexW1964888429MaRDI QIDQ1761715

Rudolf Freund, Kenichi Morita, Artiom Alhazov

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-011-9267-8

zbMATH Keywords

determinismuniversalitydecidabilityreversibilityP systemsinhibitorsprioritiestheoretical computer sciencemultiset processing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Applications of computability and recursion theory (03D80)

Related Items (7)

Properties of Membrane Systems ⋮ Predictors for flat membrane systems ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ A P systems variant for reasoning about sequential controllability of Boolean networks ⋮ Simulating reversible computation with reaction systems ⋮ Theory of reaction automata: a survey ⋮ P colonies. Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conservative logic
• Universality of a reversible two-counter machine
• A hierarchy of uniquely parsable grammar classes and deterministic acceptors
• ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS
• Reversibility and Determinism in Sequential Multiset Rewriting
• A Universal Reversible Turing Machine
• Logical Reversibility of Computation

This page was built for publication: Sequential and maximally parallel multiset rewriting: reversibility and determinism