A quadratic construction for Zielonka automata with acyclic communication structure

In this paper we show a simple, quadratic construction in the case where the synchronization actions are binary and define an acyclic communication graph.