Preview
Unable to display preview. Download preview PDF.
References
Brandenburg, Uniformly growing k-th power free homomorphism, Theoretical Computer Science, 23 (1983) 69–82.
M. Lothaire, Combinatorics on words, Addison-Wesley (1983).
A. Restivo, S. Salemi, On weakly square free words, Bulletin of EATCS, 21 (1983) 49–56.
R. Shelton, R. Soni, Aperiodic words on three symbols, III, J. reine angew Math. 330 (1982) 44–52.
A. Thue, Uber unendliche Zeichernereihen, Norske Vid. Selsk. Skr; I, Mat. Nat. Kl. Christiana 7 (1906) 1–22.
A. Thue, Uber die gegenseitige Lage gleicher Teile gewisser Zeichernreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 1 (1912) 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
Restivo, A., Salemi, S. (1985). Overlap free words on two symbols. 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_35
Download citation
DOI: https://doi.org/10.1007/3-540-15641-0_35
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