Abstract
We introduce and study a new complexity function on words, which we call cyclic complexity, which counts the number of conjugacy classes of factors of each given length. We extend the famous Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words having different slopes. More precisely, we prove that if x is a Sturmian word and y is a word having the same cyclic complexity of x then y is Sturmian and, up to renaming letters, it has the same language of factors of x.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Sturmian and episturmian words (a survey of some recent results). In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 23–47. Springer, Heidelberg (2007)
Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words. CRM monograph series, vol. 27. American Mathematical Society (2008)
Blanchet-Sadri, F., Fox, N.: On the asymptotic abelian complexity of morphic words. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 94–105. Springer, Heidelberg (2013)
Borel, J.-P., Reutenauer, C.: On Christoffel classes. RAIRO Theor. Inform. Appl. 40(1), 15–27 (2006)
Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Internat. J. Found. Comput. Sci. 15(2), 293–306 (2004)
Jenkinson, O., Zamboni, L.Q.: Characterisations of balanced words via orderings. Theoret. Comput. Sci. 310(1-3), 247–271 (2004)
Kamae, T., Zamboni, L.: Maximal pattern complexity for discrete systems. Ergodic Theory Dynam. Systems 22(4), 1201–1214 (2002)
Karhumäki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. J. Comb. Theory, Ser. A 120(8), 2189–2206 (2013)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Madill, B., Rampersad, N.: The abelian complexity of the paperfolding word. Discrete Math. 313(7), 831–838 (2013)
Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inform. Process. Lett. 86(5), 241–246 (2003)
Mignosi, F., Restivo, A.: A new complexity function for words based on periodicity. Internat. J. Algebra Comput. 23(4), 963–988 (2013)
Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theoret. Comput. Sci. 273(1-2), 99–117 (2002)
Morse, M., Hedlund, G.A.: Symbolic dynamics. Amer. J. Math. 60, 1–42 (1938)
Fogg, N.P.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Math., vol. 1794. Springer (2002)
Richomme, G., Saari, K., Zamboni, L.: Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83(1), 79–95 (2011)
Rigo, M., Salimov, P.: Another generalization of abelian equivalence: Binomial complexity of infinite words. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 217–228. Springer, Heidelberg (2013)
Saarela, A.: Ultimately constant abelian complexity of infinite words. J. Autom. Lang. Comb. 14(3-4), 255–258 (2010)
Turek, O.: Abelian complexity and abelian co-decomposition. Theoret. Comput. Sci. 469, 77–91 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Cassaigne, J., Fici, G., Sciortino, M., Zamboni, L.Q. (2014). Cyclic Complexity of Words. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44521-1
Online ISBN: 978-3-662-44522-8
eBook Packages: Computer ScienceComputer Science (R0)