On the properties of language classes defined by bounded reaction automata

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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
Publication statusPublished - 2012 Oct 5
Externally publishedYes


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On the properties of language classes defined by bounded reaction automata'. Together they form a unique fingerprint.

Cite this