The set of types of a finitely generated variety
Abstract The paper presents an algorithm of polynomial time complexity to compute the type set of a finite algebraic system A , as defined in the monograph of McKenzie and Hobby: ‘The Structure of Finite Algebras’. To do so, it introduces the concept of a subtrace, and uses subtraces to characterize the type set of A . It is also shown that to calculate the type set of the variety generated by A is more difficult, by presenting various examples, in which a given type occurs only in subalgebras of high powers of A .