Reaction automata

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori

Research output: Contribution to journalArticle

13 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)247-257
Number of pages11
JournalTheoretical Computer Science
Volume429
DOIs
Publication statusPublished - 2012 Apr 20

Keywords

  • Models of biochemical reactions
  • Reaction automata
  • Turing computability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Reaction automata'. Together they form a unique fingerprint.

  • Cite this