The computational capability of chemical reaction automata

被引：1

作者：

Okubo, Fumiya ^{[1
]}

Yokomori, Takashi ^{[2
]}

机构：

[1] Kyushu University, 744 Motooka, Nishi-ku, Fukuoka

[2] Department of Mathematics, Waseda University 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8727卷

基金：

日本学术振兴会;

关键词：

Chemical reaction automata; Chemical reaction networks; Reaction automata; Turing computability;

D O I：

10.1007/978-3-319-11295-4_4

中图分类号：

学科分类号：

摘要：

We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant of reaction automata (RAs) studied in recent literature ([7–9]).; We show that CRAs in maximally parallel manner are computationally equivalent to Turing machines, while the computational power of CRAs in sequential manner coincides with that of the class of Petri nets, which is in marked contrast to the result that RAs (in both maximally parallel and sequential manners) have the computing power of Turing universality ([7, 8]). Intuitively, CRAs are defined as RAs without inhibitor functioning in each reaction, providing an offline model of computing by chemical reaction networks (CRNs).; Thus, the main results in this paper not only strengthen the previous result on Turing computability of RAs but also clarify the computing powers of inhibitors in RA computation. © Springer International Publishing Switzerland 2014.

引用

页码：53 / 66

页数：13

共 14 条

[1] Calude C.S., Pun G., Rozenberg G., Salomaa A., Multiset Processing, 2235, (2001)
[2] Csuhaj-Varju E., Ibarra O.H., Vaszil G., On the computational complexity of P automata, Natural Computing, 5, pp. 109-126, (2006)
[3] Csuhaj-Varju E., Vaszil G., P automata, The Oxford Handbook of Membrane Computing, pp. 145-167, (2010)
[4] Ehrenfeucht A., Rozenberg G., Reaction systems, Fundamenta Informaticae, 75, pp. 263-280, (2007)
[5] Fischer P.C., Turing Machines with Restricted Memory Access, Inform. and Contr, 9, 4, pp. 364-379, (1966)
[6] Hopcroft J.E., Motwani T., Ullman J.D., Introduction to automata theory, language and computation, (2003)
[7] Okubo F., Reaction automata working in sequential manner, RAIRO Theoretical Informatics and Applications, 48, pp. 23-38, (2014)
[8] Okubo F., Kobayashi S., Yokomori T., Reaction automata, Theoretical Computer Science, 429, pp. 247-257, (2012)
[9] Okubo F., Kobayashi S., Yokomori T., On the properties of language classes defined by bounded reaction automata, Theoretical Computer Science, 454, pp. 206-221, (2012)
[10] Peterson J.L., Petri Net Theory and the Modeling of Systems, (1981)

← 1 2 →