P colonies and their extensions

Authors:
Ludék Cienciala;Lucie Ciencialová
Affiliations:
Institute of Computer Science, Silesian Univerzity in Opava, Opava;Institute of Computer Science, Silesian Univerzity in Opava, Opava
Venue:
Computation, cooperation, and life
Year:
2011

Citing 3
Cited 0

Computation: finite and infinite machines

Computation: finite and infinite machines
On the number of agents in P colonies

WMC'07 Proceedings of the 8th international conference on Membrane computing
P colonies with a bounded number of cells and programs

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

P colonies are one of the variants of computational devices based on independent membrane agents, which are evolved and acting in a shared environment. P colonies belong to the family of models of membrane computing called P systems. We show that P colonies with capacity three and two agents using homogeneous programs without checking rules are computationally complete as well as eco-P colonies with two agents and a passive environment and PCol automata working in init mode.