Asynchronous sliding block maps
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 34 (2000) no. 2, pp. 139-156.
@article{ITA_2000__34_2_139_0,
     author = {B\'eal, Marie-Pierre and Carton, Olivier},
     title = {Asynchronous sliding block maps},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {139--156},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {2},
     year = {2000},
     zbl = {0967.68100},
     mrnumber = {1774306},
     language = {en},
     url = {http://www.numdam.org/item/ITA_2000__34_2_139_0/}
}
TY  - JOUR
AU  - Béal, Marie-Pierre
AU  - Carton, Olivier
TI  - Asynchronous sliding block maps
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
DA  - 2000///
SP  - 139
EP  - 156
VL  - 34
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_2000__34_2_139_0/
UR  - https://zbmath.org/?q=an%3A0967.68100
UR  - https://www.ams.org/mathscinet-getitem?mr=1774306
LA  - en
ID  - ITA_2000__34_2_139_0
ER  - 
%0 Journal Article
%A Béal, Marie-Pierre
%A Carton, Olivier
%T Asynchronous sliding block maps
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 139-156
%V 34
%N 2
%I EDP-Sciences
%G en
%F ITA_2000__34_2_139_0
Béal, Marie-Pierre; Carton, Olivier. Asynchronous sliding block maps. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 34 (2000) no. 2, pp. 139-156. http://www.numdam.org/item/ITA_2000__34_2_139_0/

[1] R.L. Adler, D. Coppersmith and M. Hassner, Algorithms for sliding block codes. IEEE Trans. Inform. Theory IT-29 (1983) 5-22. | MR | Zbl

[2] A. Aho, R. Sethi and J. Ullman, Compilers. Addison-Wesley (1986).

[3] J.J. Ashley, Factors and extensions of full shifts I. IEEE Trans. Inform. Theory 34 (1988) 389-399.

[4] J. J. Ashley, A linear bound for sliding-block decoder window size, II. IEEE Trans. Inform. Theory 42 (1996) 1913-1924. | MR | Zbl

[5] M.-P. Béal, Codage Symbolique. Masson (1993).

[6] M.-P. Béal and O. Carton, Asynchronous sliding block maps, in Proc. of DLT' 99 (2000) (to appear). | MR | Zbl

[7] M.-P. Béal and D. Perrin, Symbolic dynamics and finite automata, in Handbook of Formal Languages, edited by G. Rosenberg and A. Salomaa, Vol. 2. Springer (1997), Chap. 10. | MR

[8] C. Berge, Graphes. Gauthier-Villar (1983). | MR | Zbl

[9] J. Berstel, Transductions and Context-Pree Languages. B.G. Teubner (1979). | MR | Zbl

[10] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1984). | MR | Zbl

[11] S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1972). | MR

[12] C.C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. | MR | Zbl

[13] C. Frougny and J. Sakarovitch, Synchronized relations of finite words. Theoret. Comput. Sci. 108 (1993) 45-82. | MR | Zbl

[14] C. Frougny and J. Sakarovitch, Synchronisation déterministe des automates à délai borné. Theoret Comput. Sci. 191 (1998) 61-77. | MR | Zbl

[15] K.A. S. Immink, P. H. Siegel and J. K. Wolf, Codes for digital recorders. IEEE Trans. Inform. Theory 44 (1998) 2260-2300. | MR | Zbl

[16] D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). | MR | Zbl

[17] B. Marcus, Factors and extensions of full shifts. Monatsh. Math. 88 (1979) 239-247. | MR | Zbl

[18] B. Marcus, R. Roth and P. Siegel, Handbook of Coding Theory, Vol. 2. Elsevier (1998), chap. Constrained Systems and Coding for Recording Channels. | MR | Zbl