Todd–Coxeter Algorithm

A coset enumeration algorithm that computes the action of a finitely presented group on the cosets of a specified subgroup by building a coset table, identifying cosets via relators, and thereby determining the index of the subgroup and a permutation representation when the enumeration terminates finitely.