Decomposition of Transformation Groups of Permutation Machines

Article type: Research Article

Authors: Niemenmaa, Markku

Affiliations: Department of Mathematics, University of Oulu, SF-90570 Oulu 57, Finland

Abstract: By a permutation machine we mean a triple (Q,S,F), where Q and S are finite sets and F is a function Q × S → Q which defines a permutation on Q for every element from S. These permutations generate a permutation group G and by considering the structure of G we can obtain efficient ways to decompose the transformation group (Q,G). In this paper we first consider the situation where G is half-transitive and after this we show how to use our result in the general non-transitive case.

DOI: 10.3233/FI-1987-10403

Journal: Fundamenta Informaticae, vol. 10, no. 4, pp. 363-367, 1987