Theory of reaction automata: a survey
From MaRDI portal
Publication:1983008
DOI10.1007/s41965-021-00070-6zbMath1469.68058OpenAlexW3134667976MaRDI QIDQ1983008
Takashi Yokomori, Fumiya Okubo
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-021-00070-6
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Investigating dynamic causalities in reaction systems
- On probabilistic and quantum reaction systems
- Reaction automata
- Minimization strategies for maximally parallel multiset rewriting systems
- On the properties of language classes defined by bounded reaction automata
- P automata revisited
- On the computational complexity of P automata
- Events and modules in reaction systems
- Introducing time in reaction systems
- Computation with finite stochastic chemical reaction networks
- Conservative logic
- Transductions des langages de Chomsky
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Computing with membranes
- Computing with multisets: a survey on reaction automata theory
- Chocolate \(\mathrm{P}\) automata
- Reversible pushdown automata
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Membrane computing. An introduction.
- Functions and sequences generated by reaction systems
- The computational capability of chemical reaction automata
- Computation in networks of passively mobile finite-state sensors
- Complexity of the dynamics of reaction systems
- Decomposition and factorization of chemical reaction transducers
- Parallel program schemata
- Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy
- Reaction automata working in sequential manner
- On State Sequences Defined by Reaction Systems
- P and dP Automata: A Survey
- Efficient Turing-Universal Computation with DNA Polymers
- ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS
- FUNCTIONS DEFINED BY REACTION SYSTEMS
- Two-Way Reversible Multi-Head Finite Automata
- COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
- Inference of Reversible Languages
- Morphic Characterizations of Language Families Based on Local and Star Languages
- Reachability in Petri Nets with Inhibitor Arcs
- The Computing Power of Determinism and Reversibility in Chemical Reaction Automata
- Stably computable predicates are semilinear
- Deterministic Function Computation with Chemical Reaction Networks
- Space and Energy Efficient Computation with DNA Strand Displacement Systems
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Logical Reversibility of Computation
- Multiset processing. Mathematical, computer science, and molecular computing points of view
