QUASIGROUP HOMOTOPIES, SEMISYMMETRIZATION, AND REVERSIBLE AUTOMATA
Jonathan D. H. Smith · International Journal of Algebra and Computation · 2008
There have been two distinct approaches to quasigroup homotopies, through reversible automata or through semisymmetrization. In the current paper, these two approaches are correlated. Kernel relations of homotopies are characterized combinatorically, and shown to form a modular lattice. Nets or webs are exhibited as purely algebraic constructs, point sets of objects in the category of quasigroup homotopies. A factorization theorem for morphisms in this category is obtained.