On the polynomial complexity of the equivalence checking problem in algebraic models of programs

Abstract

Algebraic models of programs are considered for which the decidability of the equivalence checking problem is proved. A new equivalence checking algorithm stemmed from the well-known Moore technique for finite state automata is introduced. It is shown that, for some subclasses of models, this algorithm is reduced to a polynomial-time equivalence checking procedure.