Growth Problems for Avoidable Words

Abstract A word W is said to avoid a word U if no block (subword, factor) of W is the image of U under a homomorphism of free semigroups without unit. The theory of words avoiding xx (square-free words) has been much studied. The word U is said to be avoidable on n letters if there are arbitrarily long words on an n-letter alphabet that avoid U. If U is avoidable on n letters for some n, let μ(U) be the minimum possible such n. We show that μ(U) has a linear bound in terms of the alphabet size of U. We further show that there exists a word that is avoidable on four letters but not on three letters. Moreover, if U is this word, the number of words of length L on a μ(U)-letter alphabet that avoid U has a polynomial bound in terms of L, so that the question of the existence of such an example is resolved in the affirmative. In contrast, for xx the bound is known to be exponential.

[1]  R. O. Shelton,et al.  ON THE STRUCTURE AND EXTENDIBILITY OF SQUARE-FREE WORDS , 1983 .

[2]  A. Zimin.  BLOCKING SETS OF TERMS , 1984 .

[3]  Jan Brinkhuis,et al.  NON-REPETITIVE SEQUENCES ON THREE SYMBOLS , 1983 .

[4]  Franz-Josef Brandenburg,et al.  Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..

[5]  Mark Sapir,et al.  PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS , 1988 .

[6]  Stanley Burris,et al.  Embedding the dual ofΠ∞ in the lattice of equational classes of semigroups , 1971 .

[7]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[8]  Mikhail V. Volkov,et al.  Finite basis theorem for systems of semigroup identities , 1984 .

[9]  G. A. Hedlund,et al.  Unending chess, symbolic dynamics and a problem in semigroups , 1944 .

[10]  Arto Salomaa.  Morphisms of free monoids and language theory , 1979 .

[11]  Richard A. Dean.  A Sequence Without Repeats on x, x -1 , y, y -1 , 1965 .

[12]  J. Ježek.  Intervals in the lattice of varieties , 1976 .

[13]  Yuji Kobayashi,et al.  Repetition-Free Words , 1986, Theor. Comput. Sci..

[14]  K. Sigmund,et al.  Ergodic Theory on Compact Spaces , 1976 .

[15]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[16]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[17]  Ursula Schmidt,et al.  Avoidable Patterns on Two Letters , 1989, Theor. Comput. Sci..

[18]  Robert Shelton.  Aperiodic words on three symbols. , 1981 .

[19]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[20]  Maureen A. Bardwell.  The $o$-primitive components of a regular ordered permutation group. , 1979 .

[21]  M. Sapir.  Inherently Nonfinitely Based Finite Semigroups , 1988 .

[22]  P. Novikov,et al.  INFINITE PERIODIC GROUPS. I , 1968 .

[23]  Sergei Ivanovich Adian,et al.  The Burnside problem and identities in groups , 1979 .