Each word u in Fs(k) induces a function u:Gk --> G given by u:wg-->u(o,wg), where u(o,wg) is the interpretation in (G;o) of u as a o--product of the sequence wg = (g0,g1,...,gk-1) in Gk.
Write u=ov for {u,v} contained in Fs(k) iff u(o,wg)=v(o,wg) whenever wg in Gk. This =o is an equivalence relation on the set Fs = U(Fs(k)) where k in N. The sequence SaT(G;o)= (|Fs(k)/=o|) presents the subassociativity types of (G;o).
We calculate SaT(G) for a few evocative groupoids (G;o), and we initiate a study of the
partitions Fs(k)=o. Each equivalence class of
the completely free groupoid Fs is a singleton, and so
Fs realizes the theoretical
minimum k--associativity for each k from N. We propose for each k a
minimally k--associative class of finite groupoids.
BACK