| Issue |
RAIRO-Theor. Inf. Appl.
Volume 34, Number 2, March/April 2000
|
|
|---|---|---|
| Page(s) | 157 - 171 | |
| DOI | https://doi.org/10.1051/ita:2000112 | |
| Published online | 15 April 2002 | |
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;
(zakh@cs.msu.su)
Received:
3
March
2000
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.