Finitary codes for biinfinite words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 4, pp. 363-386
Voir la notice de l'article provenant de la source Numdam
@article{ITA_1992__26_4_363_0,
author = {Devolder, J. and Timmerman, E.},
title = {Finitary codes for biinfinite words},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {363--386},
publisher = {EDP-Sciences},
volume = {26},
number = {4},
year = {1992},
mrnumber = {1173175},
zbl = {0754.68066},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1992__26_4_363_0/}
}
TY - JOUR AU - Devolder, J. AU - Timmerman, E. TI - Finitary codes for biinfinite words JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1992 SP - 363 EP - 386 VL - 26 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1992__26_4_363_0/ LA - en ID - ITA_1992__26_4_363_0 ER -
%0 Journal Article %A Devolder, J. %A Timmerman, E. %T Finitary codes for biinfinite words %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1992 %P 363-386 %V 26 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1992__26_4_363_0/ %G en %F ITA_1992__26_4_363_0
Devolder, J.; Timmerman, E. Finitary codes for biinfinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 4, pp. 363-386. http://geodesic.mathdoc.fr/item/ITA_1992__26_4_363_0/
