Reaction Automata
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
TL;DR
This paper introduces reaction automata, a new computational model based on reaction systems, demonstrating their Turing universality and analyzing subclasses with space complexity in relation to the Chomsky hierarchy.
Contribution
It proposes reaction automata as a novel model extending reaction systems, establishing their Turing completeness and exploring subclasses with space constraints.
Findings
Reaction automata are Turing universal.
Subclasses with space complexity are characterized.
Comparison with Chomsky hierarchy classes.
Abstract
Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction automata are computationally Turing universal. Further, some subclasses of reaction automata with space complexity are investigated and their language classes are compared to the ones in the Chomsky hierarchy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · semigroups and automata theory · Cellular Automata and Applications