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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617–630 (2010)
de Luca, A., de Luca, A.: Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362, 282–300 (2006)
Dekking, F.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory Ser. A 27(2), 181–185 (1979)
Kari, L.: DNA computing — the arrival of biological mathematics. Math. Intelligencer 19(2), 9–22 (1997)
Kari, L., Mahalingam, K.: Watson-Crick palindromes in DNA computing. Nat. Comput. (2009), doi:10.1007/s11047-009-9131-2
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)
Leech, J.: A problem on strings of beads. Math. Gaz. 41(338), 277–278 (1957)
Morse, H.: Recurrent geodesics on a surface of negative curvature. Trans. Amer. Math. Soc. 22(1), 84–100 (1921)
Thue, A.: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl. (7), 1–22 (1906)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)