HOMOGENEOUS P COLONIES

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F07%3A%230001858" target="_blank" >RIV/47813059:19240/07:#0001858 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

HOMOGENEOUS P COLONIES

Original language description

We study P colonies introduced in [8] as a class of abstract computing devices composed of independent membrane agents, acting and evolving in a shared environment. In the present paper especially P colonies are considered, which are homogeneous with respect to the type of rules in each program of agents. The number of agents, as well as the number of programs in each agent are bounded, which are sufficient to guarantee computational completeness of homogeneous P colonies. We present results for P colonies with one and with two objects inside each agent.

Czech name

Homogenní P kolonie

Czech description

V článku studujeme P kolonie konkrétně P kolonie s homogenními programy. Ukazujeme, že s omezeným počtem programů i agentů lze dosáhnout výpočetní úplnosti P kolonií s kapacitou jedna nebo dvě.

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2007

Confidentiality

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

Article name in the collection

COMPUTING AND INFORMATICS, 27

ISBN

—

ISSN

1335-9150

e-ISSN

—

Number of pages

16

Pages from-to

—

Publisher name

—

Place of publication

Bratislava, Slovenská Republika

Event location

Thessaloniki, GREECE

Event date

Jan 1, 2007

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—