Red-Green P Automata

In this short note we extend the notion of red-green Turing machines to speci c variants of P automata. Acceptance and recognizability of nite strings by red- green automata are de ned via in nite runs of the automaton on the input string and the way how to distinguish between red and green states.