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, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. 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.
@techreport{urn:nbn:de:hebis:34-2011033037007,
author ={Nagy, Benedek and Otto, Friedrich},
title ={On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One},
copyright ={https://rightsstatements.org/page/InC/1.0/},
language ={en},
year ={2011-03-30T12:27:19Z}
}