Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-11-21
Computer Science
Formal Languages and Automata Theory
19 pages, 6 figures
Scientific paper
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.
Kobayashi Satoshi
Okubo Fumiya
Yokomori Takashi
No associations
LandOfFree
Reaction Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reaction Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reaction Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-551836