PCol Automata: Recognizing Strings with P Colonies

Abstract

We introduce the concept of a P colony automaton, an automata-like con- struct combining properties of finite automata and P colonies. We present some preliminary results on the accepting power of several variants of these extremely simple language recognizing devices, and propose problems for future research.