Abstract
The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F.J. BRANDENBURG, Uniformly growing k-th power free homomorphism, Theoretical Computer Science, 23 (1983) 69–82.
A. CARPI, A result on weakly square free words related to a problem of Restivo, Bulletin of the EATCS, 22 (1984) 116–119.
A. deLuca, A. RESTIVO, S. SALEMI, On the centers of a language, Theoretical Computer Science, 24 (1983) 21–34.
M. LOTHAIRE, Combinatorics on words, Addison-Wesley (1983).
M. NIVAT, Sur les ensembles de mots infinis engendres par une grammaire algebrique, RAIRO J. Theoretical Informatics 12 (1980) 259–278.
A. RESTIVO, S. SALEMI, On weakly square free words, Bulletin of the 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 Zeichernreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. KI. Christiana 7 (1906) 1–22.
A. THUE, Uber die gegenseitie Lage gleicher Teile gewisser Zeichernreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. KI. Christiana 1 (1912) 1–67.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Restivo, A., Salemi, S. (1985). Some Decision Results on Nonrepetitive Words. In: Apostolico, A., Galil, Z. (eds) Combinatorial Algorithms on Words. NATO ASI Series, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-82456-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82458-6
Online ISBN: 978-3-642-82456-2
eBook Packages: Springer Book Archive