An algorithm for generating a finite group with a finite set of generators

295 Views Asked by At

Let $A$ be a finite set of permutations on $\Bbb N$ with finite support. Is there a good efficient algorithm to obtain the subgroup $\left<A\right>$ of the symmetric group $\operatorname{Sym}(\Bbb N)$?