On Very Simple P Colonies

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On Very Simple P Colonies

Original language description

In this paper the authors study two very simple variants of P colonies. The first one are the systems with only one object inside the agents, and the second systems are P colonies with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these types of P colonies are able to compute any recursively enumerable set of vectors of non-negative integers.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GP201%2F09%2FP075" target="_blank" >GP201/09/P075: Membrane systems and their applications</a><br>

Continuities

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

Publication year

2009

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

Seventh Brainstorming Week on Membrane Computing

ISBN

978-84-613-2837-6

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

—

Publisher name

Fénix Editora

Place of publication

Španělsko, Sevilla

Event location

Španělsko, Sevilla

Event date

Jan 1, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—