论文信息 - Complexity of Toeplitz sequences.

Complexity of Toeplitz sequences.

Resume Nous calculons dans cet article les complexites de suites de Toeplitz obtenues a partir de suites periodiques. Nous donnons ensuite explicitement des suites de Toeplitz dont la complexite verifie des proprietes donnees.

Michel Koskas

[1] Jean-Paul Allouche,et al. The number of factors in a paperfolding sequence , 1992, Bulletin of the Australian Mathematical Society.

[2] G. A. Hedlund,et al. Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[3] Désiré Razafy Andriamampianina. Le p-pliage de papier , 1989 .

[4] Jean-Paul Allouche,et al. Tours de Hanoï et automates , 1990, RAIRO Theor. Informatics Appl..

[5] Aldo de Luca,et al. Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups , 1989, Theor. Comput. Sci..

[6] Srecko Brlek,et al. Enumeration of factors in the Thue-Morse word , 1989, Discret. Appl. Math..

[7] Jean-Paul Allouche,et al. Sur la complexite des suites in nies , 1994 .