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

    Fingerprint

    Automata
    Computing
    Multiset
    Space Complexity
    Turing
    Formal Model
    Manipulation
    Strings
    Language

    Keywords

    • Models of biochemical reactions
    • Reaction automata
    • Turing computability

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Reaction automata. / Okubo, Fumiya; Kobayashi, Satoshi; Yokomori, Takashi.

    In: Theoretical Computer Science, Vol. 429, 20.04.2012, p. 247-257.

    Research output: Contribution to journalArticle

    Okubo, Fumiya ; Kobayashi, Satoshi ; Yokomori, Takashi. / Reaction automata. In: Theoretical Computer Science. 2012 ; Vol. 429. pp. 247-257.
    @article{5ccdfa22a10447fc8f9f13fd41114f42,
    title = "Reaction automata",
    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.",
    keywords = "Models of biochemical reactions, Reaction automata, Turing computability",
    author = "Fumiya Okubo and Satoshi Kobayashi and Takashi Yokomori",
    year = "2012",
    month = "4",
    day = "20",
    doi = "10.1016/j.tcs.2011.12.045",
    language = "English",
    volume = "429",
    pages = "247--257",
    journal = "Theoretical Computer Science",
    issn = "0304-3975",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - Reaction automata

    AU - Okubo, Fumiya

    AU - Kobayashi, Satoshi

    AU - Yokomori, Takashi

    PY - 2012/4/20

    Y1 - 2012/4/20

    N2 - 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.

    AB - 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.

    KW - Models of biochemical reactions

    KW - Reaction automata

    KW - Turing computability

    UR - http://www.scopus.com/inward/record.url?scp=84858335042&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84858335042&partnerID=8YFLogxK

    U2 - 10.1016/j.tcs.2011.12.045

    DO - 10.1016/j.tcs.2011.12.045

    M3 - Article

    AN - SCOPUS:84858335042

    VL - 429

    SP - 247

    EP - 257

    JO - Theoretical Computer Science

    JF - Theoretical Computer Science

    SN - 0304-3975

    ER -