Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática
Abstract
We introduce a new acceptance mode for APCol systems (Automaton-like P
colonies), variants of P colonies where the environment of the agents is given by a string
and during functioning the agents change their own states and process the string similarly
to automata. In case of the standard variant, the string is accepted if it can be reduced
to the empty word. In this paper, we de ne APCol systems where the agents verify their
environment, a model resembling multihead nite automata. In this case, a string of
length n is accepted if during every halting computation the length of the environmental
string in the con gurations does not change and in the course of the computation every
agent applies a rule to a symbol on position i of some of the environmental strings for
every i, 1 < i < n at least once. We show that these verifying APCol systems simulate
one-way multihead nite automata
