2017
P Colonies with Evolving Environment
CIENCIALOVÁ, Lucie; Luděk CIENCIALA and Petr SOSÍKBasic information
Original name
P Colonies with Evolving Environment
Authors
Edition
10105. vyd. Cham, Membrane Computing: 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers, p. 151-164, 14 pp. 2017
Publisher
Springer International Publishing
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Germany
Confidentiality degree
is not subject to a state or trade secret
Publication form
printed version "print"
Impact factor
Impact factor: 0.402 in 2005
RIV identification code
RIV/47813059:19240/17:A0000062
Organization unit
Faculty of Philosophy and Science in Opava
ISBN
978-3-319-54071-9
ISSN
UT WoS
000418441100010
EID Scopus
2-s2.0-85013924594
Keywords in English
P colony; Catalytic p system; 0L scheme; Computational completeness; Partially blind register machine
Tags
International impact, Reviewed
Links
LQ1602, research and development project.
Changed: 14/3/2018 09:34, Jan Vlha
Abstract
In the original language
We study two variants of P colonies with dynamic environment changing due to an underlying 0L scheme: P colonies with two objects inside each agent that can only consume objects, and P colonies with one object inside each agent which uses rewriting and communication rules. We show that the first kind of P colonies with one consumer agent can generate all sets of natural numbers computed by partially blind register machines. The second kind of P colonies with two agents with rewriting/communication rules is computationally complete. Finally, we demonstrate that P colonies with one such agent with checking programs can simulate catalytic P systems with one catalyst, and consequently, another relation to partially blind register machines is established.