“…Coalgebra is the categorical toolkit for studying dynamics in general [45,48], and dynamics of computation in particular [25,43,50]. Coalgebras, as morphisms in the form X − → EX for an endofuctor E, provide a categorical view of automata, state machines, and processes with state update [20,42]; the other way around, all coalgebras can be thought of as processes with state update. In the framework on this paper, only a very special class of coalgebras will be considered, as the morphisms in the form X ×A − → X ×B, corresponding to what is usually called Mealy machines [8, 14, 17, .…”