Complexités de suites de Toeplitz

Discrete Mathematics

Volumn 183, Issue 1-3, 1998, Pages 161-183

  Koskas, Michel ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Subword complexity; Toeplitz sequences

Indexed keywords

EID: 0012770891     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00077-5     Document Type: Article

References (11)

1. J.-P. Allouche, Sur la complexité des suites infinies, Journée Montoises 1993.
2. J.-P. Allouche, The number of factors in a paperfolding sequence, Bull. Austral. Math. Soc. 46 (1992) 23-32.
3. J.-P. Allouche et R. Bacher, Toeplitz sequences, paperfolding, Tower of Hanoi, and progression-free sequences of integers, Enseign. Math. 38 (1992) 315-327.
4. J.-P. Allouche et M. Bousquet-Mélou, Canonical positions for the factors in the paperfolding sequence, Theoret. Comput. Sci., à paraître.
5. J.-P. Allouche et F. Dress, Tours de Hanoi et automates, Info. Th. et appl. 24 (1990) 1-15.
6. S. Brlek, Enumeration of factors in the Thue-Morse word, Discrete Appl. Math. 24 (1989) 83-96.
7. E.M. Coven et G.A. Hedlund, Sequences with minimal block groups, Math. Systems Theory 7 (1973) 138-153.
8. A. de Luca et S. Varricchio, Some Combinatorial properties of the Thue-Morse Sequence, Theoret. Comp. Sci. 63 (1989) 333-348.
9. A.M. Hinz, The tower of Hanoi, Enseign. Math. 35 (1989) 289-321.
10. Morse et Hedlund, Symbolics Dynamics II. Sturmian trajectories, Amer. J. Math. 62 (1940) 1-42.
11. D. Razafy Andriamampianina, Le p-pliage de papier, Ann. Fac. Sci. Toulouse 5 (1989) 410-414.