Computationally universal P systems without priorities: two catalysts are sufficient

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Computationally universal P systems without priorities: two catalysts are sufficient

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Computationally universal P systems without priorities: two catalysts are sufficient

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP201%2F02%2FP079" target="_blank" >GP201/02/P079: Distribuované modely kognitivních výpočtů</a><br>

Návaznosti

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

Rok uplatnění

2005

Kód důvěrnosti údajů

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

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

330

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

16

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—