Geodesic
On the decidability of the equivalence problem for monadic recursive programs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 2, pp. 157-171

Voir la notice de l'article provenant de la source Numdam

@article{ITA_2000__34_2_157_0,
     author = {Zakharov, Vladimir A.},
     title = {On the decidability of the equivalence problem for monadic recursive programs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {157--171},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {2},
     year = {2000},
     mrnumber = {1774307},
     zbl = {0962.68091},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_2000__34_2_157_0/}
}
TY  - JOUR
AU  - Zakharov, Vladimir A.
TI  - On the decidability of the equivalence problem for monadic recursive programs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 157
EP  - 171
VL  - 34
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_2000__34_2_157_0/
LA  - en
ID  - ITA_2000__34_2_157_0
ER  - 
%0 Journal Article
%A Zakharov, Vladimir A.
%T On the decidability of the equivalence problem for monadic recursive programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 157-171
%V 34
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_2000__34_2_157_0/
%G en
%F ITA_2000__34_2_157_0
Zakharov, Vladimir A. On the decidability of the equivalence problem for monadic recursive programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 2, pp. 157-171. http://geodesic.mathdoc.fr/item/ITA_2000__34_2_157_0/