Asynchronous sliding block maps
Béal, Marie-Pierre ; Carton, Olivier
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000), p. 139-156 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 2000-01-01
@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},
     volume = {34},
     year = {2000},
     pages = {139-156},
     mrnumber = {1774306},
     zbl = {0967.68100},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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, Tome 34 (2000) pp. 139-156. http://gdmltest.u-ga.fr/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 711274 | Zbl 0499.94009

[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 1465748 | Zbl 0868.94052

[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 1880480 | Zbl 1013.68100

[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 1470015

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

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

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

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

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

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

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

[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 1658795 | Zbl 0933.94007

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

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

[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 1667956 | Zbl 0983.94015