Voir la notice de l'article provenant de la source Math-Net.Ru
@article{TM_2003_242_a11, author = {A. Carpi and A. de Luca}, title = {Full and {Uniform} {Sequences}}, journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova}, pages = {141--146}, publisher = {mathdoc}, volume = {242}, year = {2003}, language = {en}, url = {http://geodesic.mathdoc.fr/item/TM_2003_242_a11/} }
A. Carpi; A. de Luca. Full and Uniform Sequences. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Mathematical logic and algebra, Tome 242 (2003), pp. 141-146. http://geodesic.mathdoc.fr/item/TM_2003_242_a11/
[1] Carpi A., de Luca A., “Words and special factors”, Theor. Comput. Sci., 259 (2001), 145–182 | DOI | MR | Zbl
[2] Carpi A., de Luca A., “Uniform words”, Adv. Appl. Math. (to appear)
[3] de Bruijn N. G., “A combinatorial problem”, Proc. Ned. Akad. Wet., 49 (1946), 758–764 | MR
[4] Fredricksen H., “A survey of full length nonlinear shift register cycle algorithms”, SIAM Rev., 24 (1982), 195–221 | DOI | MR | Zbl
[5] Lothaire M., Combinatorics on words, 2nd ed., Cambridge Math. Library, Cambridge Univ. Press, Cambridge, 1997 | MR | Zbl
[6] Marshall A. W., Olkin I., Inequalities: Theory of majorization and its applications, Acad. Press, New York, 1979 | MR