The Computing Power of Determinism and Reversibility in Chemical Reaction Automata

DOI10.1007/978-3-319-73216-9_13zbMath1434.68166OpenAlexW2788919238MaRDI QIDQ5112176

Fumiya Okubo, Takashi Yokomori

Publication date: 28 May 2020

Published in: Reversibility and Universality (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73216-9_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Theory of reaction automata: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reaction automata
• On the properties of language classes defined by bounded reaction automata
• Reversible computing and cellular automata -- a survey
• Conservative logic
• Computation and construction universality of reversible cellular automata
• Universality of a reversible two-counter machine
• Reversible pushdown automata
• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• The computational capability of chemical reaction automata
• Reaction automata working in sequential manner
• Efficient Turing-Universal Computation with DNA Polymers
• ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS
• Two-Way Reversible Multi-Head Finite Automata
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• Generalized Communicating P Automata
• Space and Energy Efficient Computation with DNA Strand Displacement Systems
• Logical Reversibility of Computation
• Multiset processing. Mathematical, computer science, and molecular computing points of view

This page was built for publication: The Computing Power of Determinism and Reversibility in Chemical Reaction Automata