Membrane Computing: When Communication Is Enough

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F02%3A50000004" target="_blank" >RIV/47813059:19240/02:50000004 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Membrane Computing: When Communication Is Enough

Popis výsledku v původním jazyce

We study the computational power of P systems, the mathematical model of cellular membrane systems whose operations are motivated by some principles of regulated transfer of objects (molecules) through membranes and simple mutural reactions of these objects. The original model of P system describes several possible types of operations applicable to these objects, resulting in universal computational power. We show that P systems with symbol objects keep their universal computational power even if werestrict ourselves to catalyzed transport of objects through labelled membranes without their change or mutural reactions. Each transport operation is initiated by a complex of at most two objects. Moreover we do not need some other mathematical tools of P-systems like priorities of oeprators or dissolution or creation of membranes to reach the universal computational power. In the second part of the paper we presenta communicating P-system computing optimal parallel algorithm.

Název v anglickém jazyce

Membrane Computing: When Communication Is Enough

Popis výsledku anglicky

We study the computational power of P systems, the mathematical model of cellular membrane systems whose operations are motivated by some principles of regulated transfer of objects (molecules) through membranes and simple mutural reactions of these objects. The original model of P system describes several possible types of operations applicable to these objects, resulting in universal computational power. We show that P systems with symbol objects keep their universal computational power even if werestrict ourselves to catalyzed transport of objects through labelled membranes without their change or mutural reactions. Each transport operation is initiated by a complex of at most two objects. Moreover we do not need some other mathematical tools of P-systems like priorities of oeprators or dissolution or creation of membranes to reach the universal computational power. In the second part of the paper we presenta communicating P-system computing optimal parallel algorithm.

Druh

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

CEP obor

BD - Teorie informace

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í

2002

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

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

2509

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

12

Strana od-do

264-275

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—