Reaction automata working in sequential manner

Fumiya Okubo

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Based on the formal framework of reaction systems by Ehrenfeucht and Rozenberg [Fund. Inform. 75 (2007) 263-280], reaction automata (RAs) have been introduced by Okubo et al. [Theoret. Comput. Sci. 429 (2012) 247-257], as language acceptors with multiset rewriting mechanism. In this paper, we continue the investigation of RAs with a focus on the two manners of rule application: maximally parallel and sequential. Considering restrictions on the workspace and the λ-input mode, we introduce the corresponding variants of RAs and investigate their computation powers. In order to explore Turing machines (TMs) that correspond to RAs, we also introduce a new variant of TMs with restricted workspace, called s(n)-restricted TMs. The main results include the following: (i) for a language L and a function s(n), L is accepted by an s(n)-bounded RA with λ-input mode in sequential manner if and only if L is accepted by a logâ?‰ s(n)-bounded one-way TM; (ii) if a language L is accepted by a linear-bounded RA in sequential manner, then L is also accepted by a P automaton [Csuhaj-Varju and Vaszil, vol. 2597 of Lect. Notes Comput. Sci. Springer (2003) 219-233.] in sequential manner; (iii) the class of languages accepted by linear-bounded RAs in maximally parallel manner is incomparable to the class of languages accepted by RAs in sequential manner.

Original languageEnglish
Pages (from-to)23-38
Number of pages16
JournalRAIRO - Theoretical Informatics and Applications
Volume48
Issue number1
DOIs
Publication statusPublished - Jan 2014

Fingerprint

Turing machines
Automata
Turing Machine
Workspace
Multiset
Parallel Applications
Rewriting
Continue
Language
If and only if
Restriction

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Computer Science Applications

Cite this

Reaction automata working in sequential manner. / Okubo, Fumiya.

In: RAIRO - Theoretical Informatics and Applications, Vol. 48, No. 1, 01.2014, p. 23-38.

Research output: Contribution to journalArticle

@article{fb10b084312d4be0ac08b8a033756af8,
title = "Reaction automata working in sequential manner",
abstract = "Based on the formal framework of reaction systems by Ehrenfeucht and Rozenberg [Fund. Inform. 75 (2007) 263-280], reaction automata (RAs) have been introduced by Okubo et al. [Theoret. Comput. Sci. 429 (2012) 247-257], as language acceptors with multiset rewriting mechanism. In this paper, we continue the investigation of RAs with a focus on the two manners of rule application: maximally parallel and sequential. Considering restrictions on the workspace and the λ-input mode, we introduce the corresponding variants of RAs and investigate their computation powers. In order to explore Turing machines (TMs) that correspond to RAs, we also introduce a new variant of TMs with restricted workspace, called s(n)-restricted TMs. The main results include the following: (i) for a language L and a function s(n), L is accepted by an s(n)-bounded RA with λ-input mode in sequential manner if and only if L is accepted by a log{\^a}?‰ s(n)-bounded one-way TM; (ii) if a language L is accepted by a linear-bounded RA in sequential manner, then L is also accepted by a P automaton [Csuhaj-Varju and Vaszil, vol. 2597 of Lect. Notes Comput. Sci. Springer (2003) 219-233.] in sequential manner; (iii) the class of languages accepted by linear-bounded RAs in maximally parallel manner is incomparable to the class of languages accepted by RAs in sequential manner.",
author = "Fumiya Okubo",
year = "2014",
month = "1",
doi = "10.1051/ita/2013047",
language = "English",
volume = "48",
pages = "23--38",
journal = "RAIRO - Theoretical Informatics and Applications",
issn = "0988-3754",
publisher = "EDP Sciences",
number = "1",

}

TY - JOUR

T1 - Reaction automata working in sequential manner

AU - Okubo, Fumiya

PY - 2014/1

Y1 - 2014/1

N2 - Based on the formal framework of reaction systems by Ehrenfeucht and Rozenberg [Fund. Inform. 75 (2007) 263-280], reaction automata (RAs) have been introduced by Okubo et al. [Theoret. Comput. Sci. 429 (2012) 247-257], as language acceptors with multiset rewriting mechanism. In this paper, we continue the investigation of RAs with a focus on the two manners of rule application: maximally parallel and sequential. Considering restrictions on the workspace and the λ-input mode, we introduce the corresponding variants of RAs and investigate their computation powers. In order to explore Turing machines (TMs) that correspond to RAs, we also introduce a new variant of TMs with restricted workspace, called s(n)-restricted TMs. The main results include the following: (i) for a language L and a function s(n), L is accepted by an s(n)-bounded RA with λ-input mode in sequential manner if and only if L is accepted by a logâ?‰ s(n)-bounded one-way TM; (ii) if a language L is accepted by a linear-bounded RA in sequential manner, then L is also accepted by a P automaton [Csuhaj-Varju and Vaszil, vol. 2597 of Lect. Notes Comput. Sci. Springer (2003) 219-233.] in sequential manner; (iii) the class of languages accepted by linear-bounded RAs in maximally parallel manner is incomparable to the class of languages accepted by RAs in sequential manner.

AB - Based on the formal framework of reaction systems by Ehrenfeucht and Rozenberg [Fund. Inform. 75 (2007) 263-280], reaction automata (RAs) have been introduced by Okubo et al. [Theoret. Comput. Sci. 429 (2012) 247-257], as language acceptors with multiset rewriting mechanism. In this paper, we continue the investigation of RAs with a focus on the two manners of rule application: maximally parallel and sequential. Considering restrictions on the workspace and the λ-input mode, we introduce the corresponding variants of RAs and investigate their computation powers. In order to explore Turing machines (TMs) that correspond to RAs, we also introduce a new variant of TMs with restricted workspace, called s(n)-restricted TMs. The main results include the following: (i) for a language L and a function s(n), L is accepted by an s(n)-bounded RA with λ-input mode in sequential manner if and only if L is accepted by a logâ?‰ s(n)-bounded one-way TM; (ii) if a language L is accepted by a linear-bounded RA in sequential manner, then L is also accepted by a P automaton [Csuhaj-Varju and Vaszil, vol. 2597 of Lect. Notes Comput. Sci. Springer (2003) 219-233.] in sequential manner; (iii) the class of languages accepted by linear-bounded RAs in maximally parallel manner is incomparable to the class of languages accepted by RAs in sequential manner.

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

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

U2 - 10.1051/ita/2013047

DO - 10.1051/ita/2013047

M3 - Article

AN - SCOPUS:84897398594

VL - 48

SP - 23

EP - 38

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

IS - 1

ER -