2016
Small (purely) catalytic P systems simulating register machines
SOSÍK, Petr and Miroslav LANGERBasic information
Original name
Small (purely) catalytic P systems simulating register machines
Authors
SOSÍK, Petr and Miroslav LANGER
Edition
Theoretical Computer Science, Amsterdam, Elsevier, 2016, 0304-3975
Other information
Language
English
Type of outcome
Article in a journal
Field of Study
10200 1.2 Computer and information sciences
Country of publisher
Netherlands
Confidentiality degree
is not subject to a state or trade secret
Impact factor
Impact factor: 0.698
Marked to be transferred to RIV
No
Organization unit
Faculty of Philosophy and Science in Opava
UT WoS
Keywords in English
Membrane computing; Catalytic P system; Universal computation; Register machine
Tags
Tags
International impact, Reviewed
Links
ED1.1.00/02.0070, research and development project.
Changed: 19/3/2020 14:20, doc. Ing. Petr Sosík, Dr.
Abstract
In the original language
The paper contributes to the topic of (purely) catalytic P systems. Catalytic P systems represent the original and likely the simplest class of membrane computing models. It is known that (purely) catalytic P systems with two (respectively three) catalysts and one membrane can simulate any Minsky register machine and, hence, they are computationally complete. However, the problem of minimal size of such a universal catalytic P system remains open for about ten years. We improve known results about small catalytic P systems simulating register machines in three different modes (generating, accepting, computing functions). Together with some specific universal register machine [7], one could eventually construct a small universal catalytic P system. As a consequence, we also improve the previous construction of a minimal catalytic P system generating a non-semilinear set, diminishing the number of necessary rules from 29 to 24. (C) 2015 Elsevier B.V. All rights reserved.