Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
F. J. BRANDENBURG: Uniformly growing k-th power-free homoorphisms. Theor. Comput. Science 23 (1983), p.69–82.
E. D. FIFE: Binary sequences which contain no BBb. Trans. Amer. Math. Society 261 (1) (1980), p. 115–136.
W. GOTTSCHALK-G. HEDLUND: "Topological Dynamics". Amer. Math. Soc. Colloq. Pub. Vol.36 (1955).
T. HARJU: Morphisms that avoid overlapping. University of Turku (1983).
G. HEDLUND: Remarks of the work of Axel Thue on sequences. Nord. Mat. Tidskr. 16 (1967), p.148–150.
J. KARHUMÄKI: On strongly cube-free w-words generated by binary morphisms. Springer Lecture Notes in Comp. Sci. 117 (1981), p.182–189.
M. MORSE-G. HEDLUND: Unending chess, symbolic dynamics and a problem in semi-group. Duke Math. J. 11 (1944), p.1–7.
J. J. PANSIOT: The MOrse sequence and iterated morphisms. Inf. Process. Letters 12 (1981), p.68–70.
A. RESTIVO-S. SALEMI: On weakly square-free words. Inf. Process. Letters — to appear.
P. SÉÉBOLD: Morphismes itérés, mot de Morse et mot de Fibonacci. C. R. Acad. Science 295 (1982), p.439–441.
A. THUE: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Chris. 1 (1912) p.1–67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Séébold, P. (1985). Overlap-free sequences. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-15641-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15641-3
Online ISBN: 978-3-540-39505-8
eBook Packages: Springer Book Archive