Asynchronous sliding block maps
Marie-Pierre Béal; Olivier Carton
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2000)
- Volume: 34, Issue: 2, page 139-156
- ISSN: 0988-3754
Access Full Article
topHow to cite
topBéal, Marie-Pierre, and Carton, Olivier. "Asynchronous sliding block maps." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.2 (2000): 139-156. <http://eudml.org/doc/92627>.
@article{Béal2000,
author = {Béal, Marie-Pierre, Carton, Olivier},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {asynchronous sliding block map; transducer},
language = {eng},
number = {2},
pages = {139-156},
publisher = {EDP-Sciences},
title = {Asynchronous sliding block maps},
url = {http://eudml.org/doc/92627},
volume = {34},
year = {2000},
}
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
PB - EDP-Sciences
VL - 34
IS - 2
SP - 139
EP - 156
LA - eng
KW - asynchronous sliding block map; transducer
UR - http://eudml.org/doc/92627
ER -
References
top- [1] R.L. Adler, D. Coppersmith and M. Hassner, Algorithms for sliding block codes. IEEE Trans. Inform. Theory IT-29 (1983) 5-22. Zbl0499.94009MR711274
- [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. Zbl0868.94052MR1465748
- [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). Zbl1013.68100MR1880480
- [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. MR1470015
- [8] C. Berge, Graphes. Gauthier-Villar (1983). Zbl0531.05031MR722294
- [9] J. Berstel, Transductions and Context-Pree Languages. B.G. Teubner (1979). Zbl0424.68040MR549481
- [10] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1984). Zbl0587.68066MR797069
- [11] S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1972). MR530382
- [12] C.C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. Zbl0135.00704MR216903
- [13] C. Frougny and J. Sakarovitch, Synchronized relations of finite words. Theoret. Comput. Sci. 108 (1993) 45-82. Zbl0783.68065MR1203822
- [14] C. Frougny and J. Sakarovitch, Synchronisation déterministe des automates à délai borné. Theoret Comput. Sci. 191 (1998) 61-77. Zbl1015.68128MR1490563
- [15] K.A. S. Immink, P. H. Siegel and J. K. Wolf, Codes for digital recorders. IEEE Trans. Inform. Theory 44 (1998) 2260-2300. Zbl0933.94007MR1658795
- [16] D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). Zbl1106.37301MR1369092
- [17] B. Marcus, Factors and extensions of full shifts. Monatsh. Math. 88 (1979) 239-247. Zbl0432.54036MR553733
- [18] B. Marcus, R. Roth and P. Siegel, Handbook of Coding Theory, Vol. 2. Elsevier (1998), chap. Constrained Systems and Coding for Recording Channels. Zbl0983.94015MR1667956
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.