P colonies processing strings

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F14%3A%230005324" target="_blank" >RIV/47813059:19240/14:#0005324 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/FI-2014-1090" target="_blank" >http://dx.doi.org/10.3233/FI-2014-1090</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FI-2014-1090" target="_blank" >10.3233/FI-2014-1090</a>

Result language
angličtina
Original language name
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 constructs, called automaton-like P colonies or APCol systems, behave like automata: during functioning, the agents change their own states and process thesymbols of the string. We show that the family of ?-free languages accepted by jumping finite automata is properly included in the family of languages accepted by APCol systems with one agent and any ?-free recursively enumerable language can be obtainedas a projection of a language accepted by an automaton-like P colony with two agents.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)