Computationally universal P systems without priorities: two catalysts are sufficient

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F05%3A%230002976" target="_blank" >RIV/47813059:19240/05:#0002976 - isvavai.cz</a>
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<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GP201%2F02%2FP079" target="_blank" >GP201/02/P079: Distributed models of cognitive computing</a><br>
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ů

Similar results(10)