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.
Okubo, F., Kobayashi, S., & Yokomori, T. (2012). Reaction automata. Theoretical Computer Science, 429, 247-257.
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.
Link to the online copy
Bibtex file @article{okubo2012reaction, title={Reaction automata}, author={Okubo, Fumiya and Kobayashi, Satoshi and Yokomori, Takashi}, journal={Theoretical Computer Science}, volume={429}, pages={247--257}, year={2012}, publisher={Elsevier} }