applying the telescoping cancellation idea to projective modules.

Eilenberg contributed to automata theory and algebraic automata theory. In particular, he introduced a model of computation called X-machine and a new prime decomposition algorithm for finite state machines in the vein of Krohn-Rhodes theory. He also identified