The decidability of the equivalence problem for polynomially bounded DOL sequences
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 1, pp. 17-28

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

@article{ITA_1977__11_1_17_0,
     author = {Karhum\"aki, Juhani},
     title = {The decidability of the equivalence problem for polynomially bounded {DOL} sequences},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {17--28},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {1},
     year = {1977},
     mrnumber = {464724},
     zbl = {0359.68086},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1977__11_1_17_0/}
}
TY  - JOUR
AU  - Karhumäki, Juhani
TI  - The decidability of the equivalence problem for polynomially bounded DOL sequences
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1977
SP  - 17
EP  - 28
VL  - 11
IS  - 1
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://geodesic.mathdoc.fr/item/ITA_1977__11_1_17_0/
LA  - en
ID  - ITA_1977__11_1_17_0
ER  - 
%0 Journal Article
%A Karhumäki, Juhani
%T The decidability of the equivalence problem for polynomially bounded DOL sequences
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1977
%P 17-28
%V 11
%N 1
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U http://geodesic.mathdoc.fr/item/ITA_1977__11_1_17_0/
%G en
%F ITA_1977__11_1_17_0
Karhumäki, Juhani. The decidability of the equivalence problem for polynomially bounded DOL sequences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 1, pp. 17-28. http://geodesic.mathdoc.fr/item/ITA_1977__11_1_17_0/