Computationally Complete Generalized Communicating P Systems with Three Cells

摘要

Generalized communicating P systems are particular variants of networks of cells where each rule moves only two objects. In this paper we show that GCPSs with three cells and with only join, or only split, or only chain rules are computationally complete computing devices. These bounds are improvements of the previous results.