Author:
Badkobeh Golnaz,Ochem Pascal
Abstract
We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [Theoret. Comput. Sci. 726 (2018) 1–4].
Subject
Computer Science Applications,General Mathematics,Software
Reference8 articles.
1. Growth problems for avoidable words
2. Avoidable patterns in strings of symbols
3. Iterative Algebras
4. Clark R.J.,
Avoidable formulas in combinatorics on words. Ph.D. thesis,
University of California,
Los Angeles. Available at http://www.lirmm.fr/~ochem/morphisms/clark˙thesis.pdf
(2001).
5. Avoidability of circular formulas
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lie complexity of words;Theoretical Computer Science;2022-08