Resumen de Switching transformations
The partitioning of switching functions under the group of all permutations of the n-variable configurations is discussed. It is shown that for this partitioning each equivalence class may be represented by a function requiring n or few variable ocurrences in its Boolean expression. An algorithm is given which will produce this group of permutations using sequences of variable permutations and modulo 2n additions
