Theory of reaction automata: a survey
From MaRDI portal
Publication:1983008
DOI10.1007/S41965-021-00070-6zbMATH Open1469.68058OpenAlexW3134667976MaRDI QIDQ1983008FDOQ1983008
Authors: 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
Recommendations
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Conservative logic
- Computing with membranes
- Membrane computing. An introduction.
- Efficient Turing-universal computation with DNA polymers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introducing time in reaction systems
- Functions and sequences generated by reaction systems
- Computation in networks of passively mobile finite-state sensors
- Parallel program schemata
- Investigating dynamic causalities in reaction systems
- Functions defined by reaction systems
- Reaction systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spiking neural P systems
- Logical Reversibility of Computation
- Events and modules in reaction systems
- Computation with finite stochastic chemical reaction networks
- On state sequences defined by reaction systems
- Title not available (Why is that?)
- Stably computable predicates are semilinear
- Deterministic Function Computation with Chemical Reaction Networks
- Space and energy efficient computation with DNA strand displacement systems
- Inference of Reversible Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiset processing. Mathematical, computer science, and molecular computing points of view
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Title not available (Why is that?)
- Reaction automata
- P and dP automata: a survey
- Title not available (Why is that?)
- Combinatorics of life and death for reaction systems
- Title not available (Why is that?)
- On probabilistic and quantum reaction systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimization strategies for maximally parallel multiset rewriting systems
- Title not available (Why is that?)
- Two-way reversible multi-head finite automata
- On strong reversibility in P systems and related problems
- P automata revisited
- Reachability in Petri nets with inhibitor arcs
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Transductions des langages de Chomsky
- On the properties of language classes defined by bounded reaction automata
- On the computational complexity of P automata
- Reversible pushdown automata
- Reversible P systems to simulate Fredkin circuits
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Complexity of the dynamics of reaction systems
- Computing with multisets: a survey on reaction automata theory
- Chocolate P automata
- The computational capability of chemical reaction automata
- Decomposition and factorization of chemical reaction transducers
- Finite automata with multiset memory: a new characterization of Chomsky hierarchy
- Reaction automata working in sequential manner
- Morphic characterizations of language families based on local and star languages
- The computing power of determinism and reversibility in chemical reaction automata
- The bag automaton: a model of nondeterministic storage
- Recent results in population protocols for exact majority and leader election
Cited In (8)
- Reaction automata
- The computational capability of chemical reaction automata
- Reaction automata working in sequential manner
- On the properties of language classes defined by bounded reaction automata
- Design of reactive algorithms by solving equations over automata
- The computational capability of chemical reaction automata
- Grammars of organic chemistry
- The computing power of determinism and reversibility in chemical reaction automata
This page was built for publication: Theory of reaction automata: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983008)
