CIENCIALOVÁ, Lucie, Luděk CIENCIALA and Petr SOSÍK. P Colonies with Evolving Environment. In Leporati, A.; Rozenberg, G.; Salomaa, A.; Zandron, C. Membrane Computing: 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers. 10105th ed. Cham: Springer International Publishing, 2017, p. 151-164. ISBN 978-3-319-54071-9. Available from: https://dx.doi.org/10.1007/978-3-319-54072-6.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name P Colonies with Evolving Environment
Authors CIENCIALOVÁ, Lucie, Luděk CIENCIALA and Petr SOSÍK.
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
Original 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"
RIV identification code RIV/47813059:19240/17:A0000061
Organization Filozoficko-přírodovědecká fakulta – Slezská univerzita v Opavě – Repository
ISBN 978-3-319-54071-9
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-54072-6
UT WoS 000418441100010
Keywords in English P colony; Catalytic p system; 0L scheme; Computational completeness; Partially blind register machine
Tags SGS132016, ÚI
Tags International impact, Reviewed
Links LQ1602, research and development project.
Changed by Changed by: Mgr. Kamil Matula, učo 1145. Changed: 20/3/2018 09:56.
Abstract
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.
Print
Add to clipboard Displayed: 27/4/2024 02:26