Abstract
P colony, which was introduced in [9], is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper focuses on the modularity of the P colonies with checking rules. We group the agents into modules with specific function. In the second part of the paper we introduce improved results concerning the computational power of the P colonies with capacity one. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Cienciala, L., Ciencialová, L., & Langer, M. (2012). Modularity in P colonies with checking rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 104–119). https://doi.org/10.1007/978-3-642-28024-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
