Theory of reaction automata: a survey
From MaRDI portal
Publication:1983008
Recommendations
Cites work
- scientific article; zbMATH DE number 5604070 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3523369 (Why is no real title available?)
- scientific article; zbMATH DE number 3557247 (Why is no real title available?)
- scientific article; zbMATH DE number 1951584 (Why is no real title available?)
- scientific article; zbMATH DE number 2080939 (Why is no real title available?)
- scientific article; zbMATH DE number 2080948 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3806945 (Why is no real title available?)
- scientific article; zbMATH DE number 5593274 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3248552 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Chocolate P automata
- Combinatorics of life and death for reaction systems
- Complexity of the dynamics of reaction systems
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- Computing with membranes
- Computing with multisets: a survey on reaction automata theory
- Conservative logic
- Decomposition and factorization of chemical reaction transducers
- Deterministic Function Computation with Chemical Reaction Networks
- Efficient Turing-universal computation with DNA polymers
- Events and modules in reaction systems
- Finite automata with multiset memory: a new characterization of Chomsky hierarchy
- Functions and sequences generated by reaction systems
- Functions defined by reaction systems
- Inference of Reversible Languages
- Introducing time in reaction systems
- Investigating dynamic causalities in reaction systems
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Logical Reversibility of Computation
- Membrane computing. An introduction.
- Minimization strategies for maximally parallel multiset rewriting systems
- Morphic characterizations of language families based on local and star languages
- Multiset processing. Mathematical, computer science, and molecular computing points of view
- On probabilistic and quantum reaction systems
- On state sequences defined by reaction systems
- On strong reversibility in P systems and related problems
- On the computational complexity of P automata
- On the properties of language classes defined by bounded reaction automata
- P and dP automata: a survey
- P automata revisited
- Parallel program schemata
- Reachability in Petri nets with inhibitor arcs
- Reaction automata
- Reaction automata working in sequential manner
- Reaction systems
- Recent results in population protocols for exact majority and leader election
- Reversible P systems to simulate Fredkin circuits
- Reversible pushdown automata
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Space and energy efficient computation with DNA strand displacement systems
- Spiking neural P systems
- Stably computable predicates are semilinear
- The bag automaton: a model of nondeterministic storage
- The computational capability of chemical reaction automata
- The computing power of determinism and reversibility in chemical reaction automata
- Transductions des langages de Chomsky
- Two-way reversible multi-head finite automata
Cited in
(8)- Reaction automata working in sequential manner
- The computational capability of chemical reaction automata
- Reaction automata
- 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)
