Reaction automata

DOI10.1016/J.TCS.2011.12.045zbMath1276.68074arXiv1111.5038OpenAlexW2911301805MaRDI QIDQ418799

Satoshi Kobayashi, Takashi Yokomori, Fumiya Okubo

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.5038

zbMATH Keywords

Turing computabilitymodels of biochemical reactionsreaction automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Decomposition and factorization of chemical reaction transducers ⋮ On the computational power of swarm automata using agents with position information ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Theory of reaction automata: a survey ⋮ Model checking temporal properties of reaction systems ⋮ On the properties of language classes defined by bounded reaction automata ⋮ The computational capability of chemical reaction automata ⋮ Minimal Reaction Systems Revisited and Reaction System Rank

Cites Work

• Minimization strategies for maximally parallel multiset rewriting systems
• Events and modules in reaction systems
• Introducing time in reaction systems
• Computation with finite stochastic chemical reaction networks
• A variant of random context grammars: Semi-conditional grammars
• Computing with membranes
• P and dP Automata: A Survey
• FUNCTIONS DEFINED BY REACTION SYSTEMS
• COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
• Pushdown automata, multiset automata, and Petri nets
• Multiset processing. Mathematical, computer science, and molecular computing points of view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reaction automata