Skip to main content
SpringerLink
Log in

Words that Can Be Avoided

  • Chapter
  • First Online:
Combinatorial Algebra: Syntax and Semantics

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 1305 Accesses

Abstract

We start with an old problem from number theory whose solution leads to the first example of an infinite cube-free word, thus showing that the word x 3 is avoidable. Then we shall describe all avoidable words.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A. Adler, S.-Y. Robert Li, Magic cubes and Prouhet sequences. Am. Math. Mon. 84, 618–627 (1977)

    Article  MATH  Google Scholar 

  2. S.E. Arshon, A proof of the existence of n-valued infinite assymmetric sequences. Mat. Sb. 2(44), 769–777 (1937)

    Google Scholar 

  3. K.A. Baker, G.F. McNulty, W. Taylor, Growth problems for avoidable words. Theor. Comput. Sci. 69(3), 319–345 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. D.R. Bean, A. Ehrenfeucht, G.F. McNulty, Avoidable patterns in strings of symbols. Pac. J. Math. 85, 261–294 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Berstel, Mots sans carré et morphismes itérés. Discret. Math. 29, 235–244 (1979)

    Article  MathSciNet  Google Scholar 

  6. J. Berstel, Sur les mots sans carré définis par un morphisme, in ICALP, Graz, ed. by A. Maurer (Springer, 1979), pp. 16–25

    Google Scholar 

  7. A. Carpi, On abelian squares and substitutions, in WORDS, Rouen, 1997. Theor. Comput. Sci. 218(1), 61–81 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. R.J. Clark, The existence of a pattern which is 5-avoidable but 4-unavoidable. Int. J. Algebra Comput. 16(2), 351–367 (2006)

    Article  MATH  Google Scholar 

  9. M. Coudrain, M.P. Schützenberger. Une condition de finitude des monoides finiment engendrés. C. R. Acad. Sci. Paris. Serie A 262, 1149–1151 (1966)

    MATH  Google Scholar 

  10. M. Crochemore, Sharp characterizations of square-free morphisms. Theor. Comput. Sci. 18, 221–226 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  11. J.D. Currie, Pattern avoidance: themes and variations. Theor. Comput. Sci. 339(1), 7–18 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. J.D. Currie, V. Linek, Avoiding patterns in the abelian sense. Can. J. Math. 51(4), 696–714 (2001)

    Article  MathSciNet  Google Scholar 

  13. N.P. Fogg, Substitutions in Dynamics, Arithmetics and Combinatorics, ed. by V. Berthé, S. Ferenczi, C. Mauduit, A. Siegel. Lecture Notes in Mathematics, vol. 1794 (Springer, Berlin, 2002)

    Google Scholar 

  14. J. Karhumäki, On cube free ω-words generated by binary morphisms. Discret. Appl. Math. 5, 279–297 (1983)

    Article  MATH  Google Scholar 

  15. J. Levitzki, Prime ideals and the lower radical. Am. J. Math. 73(1), 25–29 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Lothaire, Combinatorics on Words. Volume 17 of Encyclopedia of Mathematics and Its Applications (Addison-Wesley, Reading, 1983)

    Google Scholar 

  17. M. Lothaire. Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 90 (Cambridge University Press, Cambridge, 2002)

    Google Scholar 

  18. G.F. McNulty, Talks at the Twenty First Victorian Algebra Conference with Workshop on Universal Algebraic Techniques in Semigroup Theory and Algebraic Logic, Melbourne, Oct 2003

    Google Scholar 

  19. I.L. Mel’nichuk, Existence of infinite finitely generated free semigroups in certain varieties of semigroups, in Algebraic Systems with One Action and Relation (Leningrad. Gos. Ped. Inst., Leningrad, 1985), pp. 74–83

    Google Scholar 

  20. F. Mignosi, P. Séébold, If a D0L language is k-power free then it is circular, in Proceedings of 20th International Conference on Automata, Languages, and Programming (ICALP), Lund. Lecture Notes in Computer Science, vol. 700 (Springer, Berlin/New York, 1993), pp. 507–518

    Google Scholar 

  21. M. Morse, G.A. Hedlund, Symbolic dynamics. Am. J. Math. 60, 815–866 (1938)

    MathSciNet  Google Scholar 

  22. M.E. Prouhet, Mémoire sur quelques relations entre les puissances des nombres. C. R. Acad. Sci. Paris. Serie A 33, 31 (1851)

    Google Scholar 

  23. M. Sapir, Problems of Burnside type and the finite basis property in varieties of semigroups. Izv. Akad. Nauk. SSSR. Ser. Mat. 51(2), 319–340 (1987); trans. in Math USSR–Izv 30(2), 295–314 (1988)

    Google Scholar 

  24. A.M. Shur, Growth properties of power-free languages, in Developments in Language Theory. Lecture Notes in Computer Science, vol. 6795 (Springer, Heidelberg, 2011), pp. 28–43

    Google Scholar 

  25. A. Thue, Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I. Mat. Nat. Kl. Christiana, 7, 1–22 (1906)

    Google Scholar 

  26. A.I. Zimin, Blocking sets of terms, in Fifteenth All-Union Algebra Conference, Krasnoyarsk, Abstract of Reports, Part 1, 1979, p. 63

    Google Scholar 

  27. A.I. Zimin, Blocking sets of terms. Mat. Sb. 119(3), 363–375 (1982)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Vanderbilt University, Nashville, TN, USA

    Mark V. Sapir

Authors
  1. Mark V. Sapir
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Sapir, M.V. (2014). Words that Can Be Avoided. In: Combinatorial Algebra: Syntax and Semantics. Springer Monographs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-08031-4_2

Download citation

Publish with us

Policies and ethics

Search

Navigation