Abstract
In combinatorics on words, a word w over an alphabet \(\varSigma \) is said to avoid a pattern p over an alphabet \(\varDelta \) if there is no factor f of w such that \(f=h(p)\) where \(h:\varDelta ^*\rightarrow \varSigma ^*\) is a non-erasing morphism. A pattern p is said to be k-avoidable if there exists an infinite word over a k-letter alphabet that avoids p. A pattern is doubled if every variable occurs at least twice. Doubled patterns are known to be 3-avoidable. Currie, Mol, and Rampersad have considered a generalized notion which allows variable occurrences to be reversed. That is, \(h(V^R)\) is the mirror image of h(V) for every \(V\in \varDelta \). We show that doubled patterns with reversal are 3-avoidable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Currie, J., Mol, L.: The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866, 56–69 (2021)
Currie, J., Mol, L., Rampersad, N.: A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5), 477–493 (2017)
Currie, J., Mol, L., Rampersad, N.: Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738, 25–41 (2018)
Bell, J., Goh, T.L.: Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inform. Comput. 205, 1295–1306 (2007)
Ochem, P.: A generator of morphisms for infinite words. RAIRO Theoret. Inform. Appl. 40, 427–441 (2006)
Ochem, P.: Doubled patterns are 3-avoidable. Electron. J. Comb. 23(1), #P1.19 (2016)
Ochem, P.: A family of formulas with reversal of arbitrarily high avoidability index. arXiv:2103.07693
Ochem, P.: Rosenfeld, M: On some interesting ternary formulas. Electron. J. Comb. 26(1), #P1.12 (2019)
Ochem, P., Rosenfeld, M.: Avoidability of palindrome patterns. Electron. J. Comb 28(1), #P1.4 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Ochem, P. (2021). Doubled Patterns with Reversal Are 3-Avoidable. In: Lecroq, T., Puzynina, S. (eds) Combinatorics on Words. WORDS 2021. Lecture Notes in Computer Science(), vol 12847. Springer, Cham. https://doi.org/10.1007/978-3-030-85088-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-85088-3_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85087-6
Online ISBN: 978-3-030-85088-3
eBook Packages: Computer ScienceComputer Science (R0)