The Computing Power of Determinism and Reversibility in Chemical Reaction Automata

Okubo, Fumiya; Yokomori, Takashi

doi:10.1007/978-3-319-73216-9_13

Cited by 6 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By newly introducing the notions of determinism and reversibility into chemical reaction automata (CRAs), the computational capability of the following six subclasses of CRAs (in sequential manner) has been investigated [58]: deterministic (DCRAs), reversible CRAs (RCRAs), and deterministic and reversible CRAs (DRCRAs) working under two conditions of both real-time and -input modes. Figure 8 illustrates the inclusion relations examined so far.…”

Section: Discussionmentioning

confidence: 99%

“…In [58], the computational capability of the following six subclasses of CRAs was investigated in the manner of sequential rewriting: deterministic CRAs (DCRAs), reversible CRAs (RCRAs), and deterministic and reversible CRAs (DRCRAs) under two conditions of both real-time andinput modes. For X in {CRA, DCRA, RCRA, DRCRA} , by L sq (X) and L sq (X) , we denote the classes of languages accepted by real-time Xs and Xs with -input mode, respectively.…”

Section: Computing Powers Of Determinacy and Reversibilitymentioning

confidence: 99%

“…Figure 8 summarizes the results on inclusion relations among these subclasses of CRA languages [58], where PN is the class of Petri net languages of L -type [67] and revREG is the class of zero-reversible regular languages [4]. The equality result PN = L sq (CRA) is shown in [56].…”

Section: Computing Powers Of Determinacy and Reversibilitymentioning

confidence: 99%

“…This survey is largely based on the achievements of research on RAs in the source references [51][52][53][54][55][56][58][59][60], and primarily discusses the computational capabilities of RAs in two application manners: the maximally parallel manner (first employed in [52,53]) and the sequential manner (mainly considered in [51,56]). Note that application manners are referred to as "evolution modes" or "update modes" in some literature.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Theory of reaction automata: a survey

Yokomori

Okubo

2021

J Membr Comput

Self Cite

View full text Add to dashboard Cite

In this paper, we survey on reaction automata theory to model and analyze the biochemical behaviors of vital reactions occurring in nature. Inspired by two notions of a reaction system initiated by Ehrenfeucht and Rozenberg in 2007 and of a multiset, reaction automata (RAs) have been proposed as computing models for accepting string languages. Given an input sequence of symbols, an RA performs its computation process as follows: at every time of receiving an input symbol, it changes the current configuration (represented by a multiset) by applying reaction rules to the multiset in a prescribed manner, for which two kinds of application manners are considered: the maximally parallel manner and the (usual) sequential manner. An RA functions as an extended finite automaton in which multisets play a role of (unbounded number of) states and the state transition is performed by applying reaction rules. We show that the computational powers of RAs are Turing universal in both manners of rule applications. The relationship between the space-bounded variants of RA and the Chomsky hierarchy is also discussed. Further, we discuss the notion of chemical reaction automata, which is a simplified variant of RAs with reaction rules that are free from inhibitor functioning. We complete this survey with a variety of related models of computing together with future research topics.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Computing Powers Of Determinacy and Reversibilitymentioning

confidence: 99%

Section: Computing Powers Of Determinacy and Reversibilitymentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Theory of reaction automata: a survey

Yokomori

Okubo

2021

J Membr Comput

Self Cite

View full text Add to dashboard Cite

show abstract

“…The research has been consistently grown in the field of chemical computing. There exist two ways to model complex chemical reactions: abstract devices and formal models based on multiset rewriting [39]. Complex chemical reaction networks carry out chemical processes that mimic the workings of classical automata models.…”

Section: Introductionmentioning

confidence: 99%