Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2010: Developments in Language Theory pp 432–433Cite as

Pseudo-power Avoidance

  • Conference paper

  • 568 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  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. Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617–630 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. de Luca, A., de Luca, A.: Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362, 282–300 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dekking, F.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory Ser. A 27(2), 181–185 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kari, L.: DNA computing — the arrival of biological mathematics. Math. Intelligencer 19(2), 9–22 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kari, L., Mahalingam, K.: Watson-Crick palindromes in DNA computing. Nat. Comput. (2009), doi:10.1007/s11047-009-9131-2

    Google Scholar 

  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. Leech, J.: A problem on strings of beads. Math. Gaz. 41(338), 277–278 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  9. Morse, H.: Recurrent geodesics on a surface of negative curvature. Trans. Amer. Math. Soc. 22(1), 84–100 (1921)

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Ehsan Chiniforooshan, Lila Kari & Zhi Xu

Authors
  1. Ehsan Chiniforooshan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lila Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhi Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiniforooshan, E., Kari, L., Xu, Z. (2010). Pseudo-power Avoidance. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation