On the Universality of Colored One-Catalyst P Systems

Article type: Research Article

Authors: Wu, Tingfang^a | Zhang, Zhiqiang^a | Păun, Gheorghe^b | Pan, Linqiang^{c; *}

Affiliations: [a] Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China. [email protected], [email protected] | [b] Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucureşti, Romania. [email protected] | [c] Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China. [email protected]

Correspondence: [*] Address for correspondence: Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China

Abstract: A control strategy on the computations in a one-catalyst P system is provided: the rules are assumed “colored” and in each step only rules of the same “color” are used. Such control leads to Turing universality for one-catalyst P systems with one membrane. Turing universality is also reached for purely catalytic P systems with two catalysts, and for purely catalytic P systems with only one catalyst and cooperating rules working in the so-called terminal mode.

Keywords: Bio-inspired computing, Membrane computing, Catalytic P system, Catalyst, Universality

DOI: 10.3233/FI-2016-1328

Journal: Fundamenta Informaticae, vol. 144, no. 2, pp. 205-212, 2016