Hostname: page-component-7479d7b7d-fwgfc Total loading time: 0 Render date: 2024-07-13T16:17:55.572Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Decidability of the Equivalence Problem for Monadic RecursivePrograms

Published online by Cambridge University Press:  15 April 2002

Vladimir A. Zakharov
Vladimir A. Zakharov*
Affiliation:
Faculty of Computational Mathematics and Cybernetics, Moscow State University, Voribyovy Gory, Moscow 119899, Russia; (zakh@cs.msu.su)
Get access

Abstract

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.

Keywords

Recursive programequivalence problemdecidabilitymonoid.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 2 , March 2000 , pp. 157 - 171
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ashcroft, E., Manna, E. and Pnueli, A., A decidable properties of monadic functional schemes. J. ACM 20 (1973) 489-499. CrossRef
B. Courcelle, Recursive applicative program schemes, in Handbook of Theoretical Computer Science, edited by J. van Leeuwen, Vol. B (1994) 459-492.
Culik II, K., New techniques for proving the decidability of equivalence problems. Lecture Notes in Comput. Sci. 317 (1988) 162-175. CrossRef
J.W. De Bakker and D.A. Scott, Theory of programs. Unpublished notes. Vienna: IBM Seminar (1969).
Friedman, E., Equivalence problems for deterministic languages and monadic recursion schemes. J. Comput. System Sci. 14 (1977) 362-399. CrossRef
Garland, S.J. and Luckham, D.C., Program schemes, recursion schemes and formal languages. J. Comput. System Sci. 7 (1973) 119-160. CrossRef
Gurari, E.M. and Ibarra, O.H., The complexity of equivalence problem for simple programs. J. ACM 28 (1981) 535-560. CrossRef
Gurari, E.M., Decidable problems for the reinforced programs. J. ACM 32 (1985) 466-483. CrossRef
D. Harel, Dynamic logics, in Handbook of Philosophical Logics, edited by D. Gabbay and F. Guenthner (1984) 497-604.
Harju, T. and Karhumaki, J., The equivalence of multi-tape finite automata. Theoret. Comput. Sci. 78 (1991) 347-355. CrossRef
Ibarra, O.H., Reversal-bounded multicounter machines and their decision problems. J. ACM 25 (1978) 116-133. CrossRef
A.A. Letichevskii, On the equivalence of automata over semigroup. Theoretic Cybernetics 6 (1970) 3-71 (in Russian).
Luckham, D.C., Park, D.M. and Paterson, M.S., On formalized computer programs. J. Comput. System Sci. 4 (1970) 220-249. CrossRef
L.P. Lisovik, Meta-linear schemes with constant assignments. Programmirovanije, The Journal of Programming and Software Engineering (1985) 29-38 (in Russian).
Lisovik, L.P., Hard sets method and semilinear reservoir method with applications. Lecture Notes in Comput. Sci. 1099 (1996) 219-231. CrossRef
M.S. Paterson, Programs schemata, Machine Intelligence. Edinburgh: Univ. Press, Vol. 3 (1968) 19-31.
Paterson, M.S., Decision problems in computational models. SIGPLAN Notices 7 (1972) 74-82. CrossRef
Rabin, M.O. and Scott, D., Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959) 114-125. CrossRef
H.G. Rice, Classes of recurcively enumerable sets and their decision problems. Trans. Amer. Math. Soc. 74 (1953).
Rutledge, J.D., Ianov's, On program schemata. J. ACM 11 (1964) 1-9. CrossRef
Sabelfeld, V.K., An algorithm deciding functional equivalence in a new class of program schemata. Theoret. Comput. Sci. 71 (1990) 265-279. CrossRef
Sabelfeld, V.K., Tree equivalence of linear recursive schemata is polynomial-time decidable. Inform. Process. Lett. 13 (1981) 147-153. CrossRef
Senizergues, G., The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Comput. Sci. 1256 (1997) 271-281.
Tomita, E. and Seino, K., The extended equivalence problem for a class of non-real-time deterministic pushdown automata. Acta Informatica 32 (1995) 395-413. CrossRef
L.G. Valiant and M.S. Paterson, Deterministic one-counter automata. J. Comput. System Sci. 10 (1975) 340-350.
J. Yanov, To the equivalence and transformations of program schemata. Rep. Soviet Acad. Sci. 113 (1957) 39-42 (in Russian).
V.A. Zakharov, The equivalence of monadic linear functional programs is decidable in polynomial time, in Proc. of the 2nd Conf. on Discrete Models in Control System Theory (1997) 35-39 (in Russian).