On the properties of language classes defined by bounded reaction automata

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions (Okubo et al. (2012) [19]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in Ehrenfeucht and Rozenberg (2007) [8]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linear-bounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by λ-LRAs) by allowing λ-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and λ-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following: the class of languages accepted by λ-LRAs forms an AFL with additional closure properties,any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA,the class of languages accepted by ERAs coincides with the class of context-sensitive languages.

    Original languageEnglish
    Pages (from-to)206-221
    Number of pages16
    JournalTheoretical Computer Science
    Volume454
    DOIs
    Publication statusPublished - 2012 Oct 5

    Fingerprint

    Automata
    Context sensitive languages
    Formal languages
    Language
    Class
    Closure Properties
    Recursively Enumerable Languages
    Formal Languages
    Multiset
    Homomorphic
    Rewriting
    Formal Model

    Keywords

    • Abstract family of languages
    • Biochemical reaction model
    • Bounded reaction automata
    • Closure property

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    On the properties of language classes defined by bounded reaction automata. / Okubo, Fumiya; Kobayashi, Satoshi; Yokomori, Takashi.

    In: Theoretical Computer Science, Vol. 454, 05.10.2012, p. 206-221.

    Research output: Contribution to journalArticle

    @article{37ba14b9e13b48408f1030ac25c1d555,
    title = "On the properties of language classes defined by bounded reaction automata",
    abstract = "Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions (Okubo et al. (2012) [19]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in Ehrenfeucht and Rozenberg (2007) [8]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linear-bounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by λ-LRAs) by allowing λ-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and λ-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following: the class of languages accepted by λ-LRAs forms an AFL with additional closure properties,any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA,the class of languages accepted by ERAs coincides with the class of context-sensitive languages.",
    keywords = "Abstract family of languages, Biochemical reaction model, Bounded reaction automata, Closure property",
    author = "Fumiya Okubo and Satoshi Kobayashi and Takashi Yokomori",
    year = "2012",
    month = "10",
    day = "5",
    doi = "10.1016/j.tcs.2012.03.024",
    language = "English",
    volume = "454",
    pages = "206--221",
    journal = "Theoretical Computer Science",
    issn = "0304-3975",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - On the properties of language classes defined by bounded reaction automata

    AU - Okubo, Fumiya

    AU - Kobayashi, Satoshi

    AU - Yokomori, Takashi

    PY - 2012/10/5

    Y1 - 2012/10/5

    N2 - Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions (Okubo et al. (2012) [19]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in Ehrenfeucht and Rozenberg (2007) [8]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linear-bounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by λ-LRAs) by allowing λ-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and λ-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following: the class of languages accepted by λ-LRAs forms an AFL with additional closure properties,any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA,the class of languages accepted by ERAs coincides with the class of context-sensitive languages.

    AB - Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions (Okubo et al. (2012) [19]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in Ehrenfeucht and Rozenberg (2007) [8]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linear-bounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by λ-LRAs) by allowing λ-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and λ-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following: the class of languages accepted by λ-LRAs forms an AFL with additional closure properties,any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA,the class of languages accepted by ERAs coincides with the class of context-sensitive languages.

    KW - Abstract family of languages

    KW - Biochemical reaction model

    KW - Bounded reaction automata

    KW - Closure property

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

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

    U2 - 10.1016/j.tcs.2012.03.024

    DO - 10.1016/j.tcs.2012.03.024

    M3 - Article

    AN - SCOPUS:84866014018

    VL - 454

    SP - 206

    EP - 221

    JO - Theoretical Computer Science

    JF - Theoretical Computer Science

    SN - 0304-3975

    ER -