Computationally universal P systems without priorities: two catalysts are sufficient

Result code in IS VaVaI

RIV/47813059:19240/05:#0002976 - isvavai.cz

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computationally universal P systems without priorities: two catalysts are sufficient

Original language description

The original model of P systems with symbol objels introduced by Păun was shown to be computationally universal, provided that catalysts and priorities of rules are used. It was shown that for the classic model of P systems with the minimal number of twomembranes the number of catalysts can be reduced from six to five; using the idea of final states the number of catalysts could even be reduced to four. In this paper we are able to reduce the number of catalysts again: two catalysts are already sufficient. For extended P systems we even need only one membrane and two catalysts. For the (purely) catalytic systems considered by Ibarra only three catalysts are already enough.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

GP201/02/P079: Distributed models of cognitive computing

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Volume of the periodical

330

Issue of the periodical within the volume

2

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

16

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—