Abstract
This paper deals with one problem concerning avoidable words. Namely, the set of words over a two-letter alphabet avoided by the Thue-Morse sequence is described. This set is a fully invariant ideal of a two-generated free semigroup, and we find its aminimal generating set.
Similar content being viewed by others
References
Bean D. R., Ehrenfeucht, A., McNulty G.Avoidable patterns in strings of symbols, Pacific J. Math.,85 (1979), 261–294.
Cassaigne, J.,Unavoidable binary patterns, Acta Inf.,30 (1993), 385–395.
Goralčik P., Vaniček T.,Binary patterns in binary worlds, Int. J. Alg. and Comp.1 (1991), 387–392.
Morse, M., Hedlund G. A.,Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J.11 (1944), 1–7.
Roth P.,Every binary pattern of length at least six is avoidable on the twoletter alphabet, Interner bericht 6/89, Fachbereich Informatic, Universität Frankfurt.
Shur A. M.,Overlap-free words and Thue-Morse sequences, Int. J. of Alg. and Comp. (to appear).
Zimin, A. I.,Blocking sets of terms, Mat. Sb.,119 (1982), 363–375 (Russian).
Author information
Authors and Affiliations
Additional information
Communicated by L. N. Shevrin
Rights and permissions
About this article
Cite this article
Shur, A.M. Binary words avoided by the Thue-Morse sequence. Semigroup Forum 53, 212–219 (1996). https://doi.org/10.1007/BF02574136
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02574136