Skip to main content
SpringerLink
Log in

Circular Words Avoiding Patterns

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

Abstract

We introduce the study of circular words avoiding patterns. We prove that there are circular binary cube-free words of every length and present several open problems regarding circular words avoiding more general patterns.

The author’s research was supported by an NSERC operating grant.

The author’s research was supported by an NSERC Undergraduate Research Award.

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kirby A. Baker, George. F. McNulty & Walter Taylor, Growth problems for avoidable words, Theoret. Comput. Sci. 69 (1989), no. 3, 319–345; MR 91f:68109.

    Article  MATH  MathSciNet  Google Scholar 

  2. Dwight R. Bean, Andrzej Ehrenfeucht & George McNulty, Avoidable Patterns in Strings of Symbols, Pacific J. Math. 85 (1979), 261–294.

    MATH  MathSciNet  Google Scholar 

  3. James D. Currie, There are ternary circular square-free words of length n for n ≥ 18, Elec. J. Comb. 9(1) N10.

    Google Scholar 

  4. Françoise Dejean, Sur un théorème de Thue, J. Combin. Theory Ser. A 13 (1972), 90–99.

    Article  MATH  MathSciNet  Google Scholar 

  5. Paul Erdös, Some unsolved problems, Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6 (1961), 221–254.

    MATH  Google Scholar 

  6. Earl D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc. 261 (1980), 115–136; MR 82a:05034

    Article  MATH  MathSciNet  Google Scholar 

  7. Vaclav Linek, Personal communication.

    Google Scholar 

  8. Marston Morse & Gustav A. Hedlund, Symbolic dynamics I, II, Amer. J. Math. 60 (1938), 815–866; 62 (1940), 1-42; MR 1, 123d.

    Article  MATH  MathSciNet  Google Scholar 

  9. Axel Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana (1912), 1–67.

    Google Scholar 

  10. A. Zimin, Blocking sets of terms, Mat. Sb. (N.S.) 119 (161) (1982); Math. USSR Sbornik 47 (1984), 353-364.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    James D. Currie & D. Sean Fitzpatrick

Authors
  1. James D. Currie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Sean Fitzpatrick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Currie, J.D., Fitzpatrick, D.S. (2003). Circular Words Avoiding Patterns. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation