Reaction automata

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori

研究成果: Article

13 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)247-257
ページ数11
ジャーナルTheoretical Computer Science
429
DOI
出版物ステータスPublished - 2012 4 20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Reaction automata' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用