In this paper we discuss P automata, i.e., accepting P systems, using in most cases only communication rules. We briefly describe the most important variants of these systems and report on their important properties, with special emphasis on their computational power and size. We also propose some new topics and problems for future research.
['Erzsébet Csuhaj-Varjú']
P automata