Globally deterministic CD-systems of stateless R-automata with window size 1

Abstract

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not. Here, we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems: the strictly deterministic systems and the globally deterministic systems.