On the Decidability of the Equivalence Problem for Monadic Recursive Programs
Faculty of Computational Mathematics and Cybernetics, Moscow State
University, Voribyovy Gory, Moscow 119899, Russia;
Accepted: 3 March 2000
We present a uniform and easy-to-use technique for deciding the equivalence problem for deterministic monadic linear recursive programs. The key idea is to reduce this problem to the well-known group-theoretic problems by revealing an algebraic nature of program computations. We show that the equivalence problem for monadic linear recursive programs over finite and fixed alphabets of basic functions and logical conditions is decidable in polynomial time for the semantics based on the free monoids and free commutative monoids.
Mathematics Subject Classification: 68Q60
Key words: Recursive program / equivalence problem / decidability / monoid.
© EDP Sciences, 2000