A class of restricted P colonies with string environment

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F16%3AN0000060" target="_blank" >RIV/47813059:19240/16:N0000060 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s11047-016-9564-3" target="_blank" >http://dx.doi.org/10.1007/s11047-016-9564-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11047-016-9564-3" target="_blank" >10.1007/s11047-016-9564-3</a>

Result language
angličtina
Original language name
A class of restricted P colonies with string environment
Original language description
In this paper we continue the study of variants of P colonies, called APCol systems, where the environment is given as a string and the model is an accepting system. We develop the concept by introducing the notion of the generating working mode. We then compare the power of a special subclass of APCol systems working in the generating mode to the power of register machines and context-free matrix grammars without appearance checking.
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/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</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
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)