Development of one approach to constructing a set of block bijective transformations

Elementary transformations are defined for finite sets of formulas in the signature $ \{*, \backslash, /\}$. A constructive description is given for the set of collections of formulas $ (w_1, \ldots, w_n) $ in variables $ x_1, \ldots, x_n $ such that for any choice of binary quasigroup (binary operation invertible in a right variable) over a finite set $\Omega$ the collection implements block bijective transformations $\Omega^n \to \Omega^n $. Collections of formulas which allow to perform calculations without using additional memory are considered separately.