Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T14:52:54.817Z Has data issue: false hasContentIssue false
  • English
  • Français

On Critical exponents in fixed points of k-uniform binary morphisms

Published online by Cambridge University Press:  20 December 2007

Dalia Krieger
Dalia Krieger*
Affiliation:
School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada; [email protected]
Get access

Abstract

Let w be an infinite fixed point of a binary k-uniform morphism f, and let Ew be the critical exponent of w. We give necessary and sufficient conditions for Ew to be bounded, and an explicit formula to compute it when it is. In particular, we show that Ew is always rational. We also sketch an extension of our method to non-uniform morphisms over general alphabets.

Keywords

Critical exponentbinary k-uniform morphism.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 43 , Issue 1 , January 2009 , pp. 41 - 68
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003).
J. Berstel, Axel Thue's Papers on Repetitions in Words: A Translation. Publications du Laboratoire de Combinatoire et d'Informatique Mathématique 20, Université du Québec à Montréal (1995).
J. Berstel, On the Index of Sturmian Words, in Jewels are forever. Springer, Berlin (1999) 287–294.
Cao, W.-T. and Wen, Z.-Y., Some properties of the factors of Sturmian sequences. Theoret. Comput. Sci. 304 (2003) 365–385. CrossRef
Carpi, A. and de Luca, A., Special factors, periodicity, and an application to Sturmian words. Acta Informatica 36 (2000) 983–1006. CrossRef
J. Cassaigne, An algorithm to test if a given circular HD0L-language avoids a pattern, in IFIP World Computer Congress'94 1 (1994) 459–464.
Damanik, D. and Lenz, D., The index of Sturmian sequences. Eur. J. Combin. 23 (2002) 23–29. CrossRef
Ehrenfeucht, A. and Rozenberg, G., Repetition of subwords in D0L languages. Inform. Control 59 (1983) 13–35. CrossRef
Fine, N.J. and Wilf, H.S., Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16 (1965) 109–114. CrossRef
Frid, A.E., On uniform DOL words. STACS'98 1373 (1998) 544–554. CrossRef
Justin, J. and Pirillo, G., Fractional powers in Sturmian words. Theoret. Comput. Sci. 255 (2001) 363–376. CrossRef
Klepinin, A.V. and Sukhanov, E.V., On combinatorial properties of the Arshon sequence. Discrete Appl. Math. 114 (2001) 155–169. CrossRef
Kobayashi, Y. and Otto, F., Repetitiveness of languages generated by morphisms. Theoret. Comput. Sci. 240 (2000) 337–378. CrossRef
Krieger, D., On critical exponents in fixed points of binary k-uniform morphisms, in STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, edited by B. Durand and W. Thomas. Lect. Notes. Comput. Sci. 3884 (2006) 104–114. CrossRef
Krieger, D., On critical exponents in fixed points of non-erasing morphisms. Theoret. Comput. Sci. 376 (2007) 70–88. CrossRef
M. Lothaire, Algebraic Combinatorics on Words, Vol. 90 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press (2002).
Lyndon, R.C. and Schützenberger, M.P., The equation aM = bNcP in a free group. Michigan Math. J. 9 (1962) 289–298.
Mignosi, F., Infinite words with linear subword complexity. Theoret. Comput. Sci. 65 (1989) 221–242. CrossRef
Mignosi, F. and Pirillo, G., Repetitions in the Fibonacci infinite word. RAIRO-Theor. Inf. Appl. 26 (1992) 199–204. CrossRef
Mignosi, F. and Séébold, P., If a D0L language is k-power free then it is circular. ICALP'93. Lect. Notes Comput. Sci. 700 (1993) 507–518. CrossRef
Mossé, B., Puissances de mots et reconnaissabilité des points fixes d'une substitution. Theoret. Comput. Sci. 99 (1992) 327–334. CrossRef
Thue, A., Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1 (1912) 1–67.
Vandeth, D., Sturmian Words and Words with Critical Exponent. Theoret. Comput. Sci. 242 (2000) 283–300. CrossRef