Skip to main content
SpringerLink
Log in

On repetition-free binary words of minimal density

Extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1450))

  • 157 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.И. жИМИН. БлОкИРУУЩИЕ МНОжЕстВА тЕРМОВ. MamemamuЧeckuŬ CБophuk, 119(3):363–375, 1982. English Translation: A.I.Zimin, Blocking sets of terms, Math. USSR Sbornik 47 (1984), 353–364.

    Google Scholar 

  2. K. Baker, G. McNulty, and W. Taylor. Growth problems for avoidable words. Theoret. Comp. Sci., 69:319–345, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Bean, A. Ehrenfeucht, and G. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math., 85(2):261–294, 1979.

    MATH  MathSciNet  Google Scholar 

  4. J. Berstel. Axel thue's work on repetitions in words. Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics, Montreal, 1992, June 1992. accessible at http://www-litp.ibp.fr:80/berstel/.

    Google Scholar 

  5. J. Berstel and D. Perrin. Theory of codes. Academic Press, 1985.

    Google Scholar 

  6. J. Cassaigne. Motifs évitables et régularités dans les mots. Thèse de doctorat, Université Paris VI, 1994.

    Google Scholar 

  7. C. Choffrut and J. Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume I. Springer, Berlin-Heidelberg-New York, 1996.

    Google Scholar 

  8. M. Crochemore and P. Goralcik. Mutually avoiding ternary words of small exponent. International Journal of Algebra and Computation, 1(4):407–410, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Currie. Open problems in pattern avoidance. American Mathematical Monthly, 100:790–793, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Dejean. Sur un théorème de Thue. J. Combinatorial Th. (A), 13:90–99, 1972.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Dekking. On the Thue-Morse measure. Acta Univ. Carolin. Math. Phis, 33(2):35–40, 1992.

    MATH  MathSciNet  Google Scholar 

  12. R. Kolpakov and G. Kucherov. Minimal letter frequency in n-power-free binary words. In Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Bratislava (Slovakia), volume 1295 of Lecture Notes in Computer Science, pages 347–357. Springer Verlag, 1997.

    Google Scholar 

  13. L. Rosaz. Making the inventory of unavoidable sets of words of fixed cardinality. Theoretical Computer Science, 1998. to appear.

    Google Scholar 

  14. A. Salomaa. Jewels of formal language theory. Computer Science Press, 1986.

    Google Scholar 

  15. A. Thue. über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania, 7:1–22, 1906.

    Google Scholar 

  16. A. Thue. über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania, 10:1–67, 1912.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Lorraine/LORIA, 615, rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy, France

    Roman Kolpakov & Gregory Kucherov

  2. Faculty of Discrete Mathematics, Department of Mechanics and Mathematics, Moscow State University, 119899, Moscow, Russia

    Yuri Tarannikov

Authors
  1. Roman Kolpakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gregory Kucherov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuri Tarannikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolpakov, R., Kucherov, G., Tarannikov, Y. (1998). On repetition-free binary words of minimal density. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055819

Download citation

  • DOI: https://doi.org/10.1007/BFb0055819

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation