Abstract
We study P colonies introduced in citekel2 as a class of abstract computing devices composed of independent membrane agents, acting and evolving in a shared environment. In the present paper especially P colonies are considered, which are homogeneous with respect to the type of rules in each program of agents. The number of agents, as well as the number of programs in each agent are bounded, which are sufficient to guarantee computational completeness of homogeneous P colonies. We present results for P colonies with one and with two objects inside each agent.
Keywords
MSC
68Q10, 68Q42
Cite this article
@article{cai-1772,
author = {Ludek Cienciala and Lucie Ciencialová and Alica Kelemenová},
title = {Homogeneous P Colonies},
journal = {Computing and Informatics},
volume = {27},
number = {3+},
pages = {481--496},
year = {2008},
issn = {1335-9150},
url = {https://cai.type.sk/content/2008/3%2B/homogeneous-p-colonies/}
}
TY - JOUR AU - Ludek Cienciala AU - Lucie Ciencialová AU - Alica Kelemenová TI - Homogeneous P Colonies JO - Computing and Informatics VL - 27 IS - 3+ SP - 481 EP - 496 PY - 2008 SN - 1335-9150 UR - https://cai.type.sk/content/2008/3%2B/homogeneous-p-colonies/ KW - P colonies KW - membrane systems KW - generative power ER -
Cienciala, L., Ciencialová, L., & Kelemenová, A. (2008). Homogeneous P Colonies. Computing and Informatics, 27(3+), 481–496. https://cai.type.sk/content/2008/3%2B/homogeneous-p-colonies/