We study cooperating distributed systems (CD-systems) of stateless deterministic
restarting automata with window size 1 that are equipped with an external pushdown store.
In this way we obtain an automata-theoretical characterization for the class of word
languages that are linearizations of context-free trace languages.