Abstract
A similarity relation is a relation on words of equal length induced by a symmetric and reflexive relation on letters. The aim of this article is to give an overview of the results concerning repetition-freeness in connection with similarity relations. We consider so called chain relations, cyclic relations and partial words, which can be seen as a special case of similarity relations. As a new result, we prove that local 3 + -repetitions can be avoided in binary partial words and the local avoidability index of \(\mathring{R}\)-cubes is five, where \(\mathring{R}\) is a relation such that the graph of the relation is a cycle.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allouche, J.-P., Shallit, J.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications: Proceedings of SETA 1998, pp. 1–16. Springer, London (1998)
Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci. 218, 135–141 (1999)
Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2007)
Blanchet-Sadri, F., Mercaş, R., Scott, G.: A generalization of Thue freeness for partial words. Theoret. Comput. Sci. 410(8-10), 793–800 (2009)
Blanchet-Sadri, F., Mercaş, R., Rashin, A., Willett, E.: An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 188–199. Springer, Heidelberg (2009)
Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E.: Avoidable Binary Patterns in Partial Words. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 106–117. Springer, Heidelberg (2010)
Blanchet-Sadri, F., Black, K., Zemke, A.: Unary Pattern Avoidance in Partial Words Dense with Holes. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 155–166. Springer, Heidelberg (2011)
Currie, J.D.: Pattern avoidance: themes and variations. Theoret. Comput. Sci. 339(1), 7–18 (2005)
Dekking, F.M.: Strongly non-repetitive sequences and progression-free sets. Journal of Combinatorial Theory, Series A 27(2), 181–185 (1979)
Erdös, P.: Some unsolved problems. Magyar Tudományos Akadémia Matematikai Kutató Intézete Közl. 6, 221–254 (1961)
Halava, V., Harju, T., Kärki, T.: Relational codes of words. Theoret. Comput. Sci. 389(1-2), 237–249 (2007)
Halava, V., Harju, T., Kärki, T.: Interaction properties of relational periods. Discrete Math. Theor. Comput. Sci. 10, 87–112 (2008)
Halava, V., Harju, T., Kärki, T.: Square-free partial words. Inform. Process. Lett. 108, 290–292 (2008)
Halava, V., Harju, T., Kärki, T., Séébold, P.: Overlap-freeness in infinite partial words. Theoret. Comput. Sci. 410, 943–948 (2009)
Kärki, T.: Repetition-freeness with cyclic relations and chain relations. Fund. Inform. 116(1-4), 157–174 (2012)
Keränen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 41–52. Springer, Heidelberg (1992)
Krieger, D., Ochem, P., Rampersad, N., Shallit, J.: Avoiding approximate squares. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 278–289. Springer, Heidelberg (2007)
Leech, J.: A problem on strings of beads. Math. Gazette 41, 277–278 (1957)
Manea, F., Mercaş, R.: Freeness of partial words. Theoret. Comput. Sci. 389(1-2), 265–277 (2007)
Thue, A.: Über unendliche Zeichenreihen. Norske Vid. Skrifter I Mat.-Nat. Kl. 7, 1–22 (1906)
Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Skrifter I Mat.-Nat. Kl. 1, 1–67 (1912)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kärki, T. (2013). Similarity Relations and Repetition-Freeness. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-40579-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40578-5
Online ISBN: 978-3-642-40579-2
eBook Packages: Computer ScienceComputer Science (R0)