Advertisement

Pseudo-power Avoidance

  • Ehsan Chiniforooshan
  • Lila Kari
  • Zhi Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6224)

Abstract

Since Thue’s work [10] in the early 1900’s, repetition avoidance has been intensely studied [9,8,7,4]. From the point of view of DNA computing [5], we study another type of repetition, called a pseudo-power, inspired by the property of the Watson- Crick complementarity in molecular biology.

References

  1. 1.
    Anne, V., Zamboni, L., Zorca, I.: Palindromes and pseudo-palindromes in episturmian and pseudo-palindromic infinite words. In: Brlek, S., Reutenauer, C. (eds.) Publications du LACIM, Proc. of Words 2005, vol. 36, pp. 91–100 (2005)Google Scholar
  2. 2.
    Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617–630 (2010)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    de Luca, A., de Luca, A.: Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362, 282–300 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dekking, F.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory Ser. A 27(2), 181–185 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kari, L.: DNA computing — the arrival of biological mathematics. Math. Intelligencer 19(2), 9–22 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kari, L., Mahalingam, K.: Watson-Crick palindromes in DNA computing. Nat. Comput. (2009), doi:10.1007/s11047-009-9131-2Google Scholar
  7. 7.
    Keränen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 41–52. Springer, Heidelberg (1992)Google Scholar
  8. 8.
    Leech, J.: A problem on strings of beads. Math. Gaz. 41(338), 277–278 (1957)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Morse, H.: Recurrent geodesics on a surface of negative curvature. Trans. Amer. Math. Soc. 22(1), 84–100 (1921)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Thue, A.: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl. (7), 1–22 (1906)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ehsan Chiniforooshan
    • 1
  • Lila Kari
    • 1
  • Zhi Xu
    • 1
  1. 1.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations