Abstract
In this paper we explore a new hierarchy of classes of languages and infinite words and its connection with complexity classes. Namely, we say that a language belongs to the class \(\mathcal L_k\) if it is a subset of the catenation of k languages S 1 ⋯ S k , where the number of words of length n in each of S i is bounded by a constant. The class of infinite words whose set of factors is in \(\mathcal L_k\) is denoted by \(\mathcal W_k\). In this paper we focus on the relations between the classes \(\mathcal W_k\) and the subword complexity of infinite words, which is as usual defined as the number of factors of the word of length n. In particular, we prove that the class \(\mathcal W_{2}\) coincides with the class of infinite words of linear complexity. On the other hand, although the class \(\mathcal W_{k}\) is included in the class of words of complexity O(n k − 1), this inclusion is strict for k > 2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Int. J. Alg. Comput. 15, 149–160 (2005)
Cassaigne, J.: Special factors of sequences with linear subword complexity. DLT 1995, 25–34. World Sci. Publishing, Singapore (1996)
Cassaigne, J., Nicolas, F.: Factor complexity. Combinatorics, automata and number theory. Encyclopedia Math. Appl., vol. 135, pp. 163–247. Cambridge Univ. Press (2010)
Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various deterministic developmental languages without interactions. Theoret. Comput. Sci. 1, 59–76 (1975)
Frid, A., Puzynina, S., Zamboni, L.Q.: On palindromic factorization of words. Advances in Applied Mathematics 50, 737–748 (2013)
Han, Y.-S., Salomaa, K., Wood, D.: Prime Decompositions of Regular Languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 145–155. Springer, Heidelberg (2006)
Leroy, J.: Some improvements of the S -adic conjecture. Adv. Appl. Math. 48(1), 79–98 (2012)
Lothaire, M.: Algebraic combinatorics on words. Cambridge University Press (2002)
Morse, M., Hedlund, G.: Symbolic dynamics. Amer. J. Math. 60, 815–866 (1938)
Pansiot, J.-J.: Complexité des facteurs des mots infinis engendrés par morphismes itérés. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 380–389. Springer, Heidelberg (1984)
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., Frid, A.E., Puzynina, S., Zamboni, L.Q. (2014). Subword Complexity and Decomposition of the Set of Factors. 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_13
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)