The algorithmic aspects of the equivalence problem and the equation solvability problem have received increasing attention in the past two decades. The equivalence problem for a finite algebra A asks whether or not two (term or polynomial) expressions s and t are equivalent over A (denoted by A |= s ≈ t), i.e. if s and t determine the same function over A. The equation solvability is one of the oldest problems of algebra: it asks whether or not two (term or polynomial) expressions s, t can… CONTINUE READING