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([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. 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 linearbounded 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 : ( i ) the class of languages accepted by λ-LRAs forms an AFL with additional closure properties, (ii) any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA, (iii) the class of languages accepted by ERAs coincides with the class of context-sensitive languages.

DOI: 10.1016/j.tcs.2012.03.024

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Okubo2012OnTP, title={On the properties of language classes defined by bounded reaction automata}, author={Fumiya Okubo and Satoshi Kobayashi and Takashi Yokomori}, journal={Theor. Comput. Sci.}, year={2012}, volume={454}, pages={206-221} }