Towards P Colonies Processing Strings

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F14%3A%230005327" target="_blank" >RIV/47813059:19240/14:#0005327 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Towards P Colonies Processing Strings
Original language description
In this paper we introduce and study P colonies where the environment is given as a string. These variants of P colonies, called Automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. After introducing the concept of APCol systems, we examine their computational power. It is shown that the family of languages accepted by jumping finite automata is properly included in the family of languages acceptedby APCol systems with one agent, and it is proved that any recursively enumerable language can be obtained as a projection of a language accepted by an Automaton-like P colony with two agents.
Czech name
—
Czech description
—

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
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
The Proceedings of the Twelfth Brainstorming Week on Membrane Computing
ISBN
978-84-940056-4-0
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
103-118
Publisher name
Research Group on Natural Computing Sevilla University
Place of publication
Sevilla,Španělsko
Event location
Sevilla, Španělsko
Event date
Jan 1, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)