Abstract
We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential. The first one is rather simple but produces a word which is not uniformly recurrent. The second construction, more involved, produces uniformly recurrent words and allows to choose the growth of the complexity function in a large family.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jean-Paul Allouche, Sur la complexité des suites inFInies, Bull. Belg. Math. Soc.1 (1994), 133–143.
Georges Blanc and Noëlle Bleuzen-Guernalec, Production en temps réel et complexité de structure de suites inFInies, RAIRO Inf. Théor. Appl. 23 (1989), 195–216.
Julien Cassaigne, Special factors of sequences with linear subword complexity, in Developments in Language Theory II (DLT∣95), pages 25–34, World Scientific, 1996.
Julien Cassaigne, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc.4 (1997), 67–88.
David G. Champernowne, The construction of decimals normal in the scale of ten, J. London Math. Soc.8 (1933), 254–260.
Andrzej Ehrenfeucht, K. P. Lee, and Grzegorz Rozenberg, Subword complexities of various classes of deterministic developmental languages without interaction, Theoret. Comput. Sci.1 (1975), 59–75.
Christian Grillenberger, Constructions of strictly ergodic systems — I. Given entropy, Z. Wahr. verw. Geb.25 (1973), 323–334.
Pascal Hubert, Complexité des suites définies par des billards rationnels, Bull. Soc. Math. France123 (1995), 257–270.
M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002.
Marston Morse and Gustav A. Hedlund, Symbolic dynamics, Amer. J. Math.60 (1938), 815–866.
Jean-Jacques Pansiot, Complexité des facteurs des mots infinis engendrés par morphismes itérés, in ICALP’ 84, pages 380–389, Lect. Notes Comp. Sci.172, Springer-Verlag, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cassaigne, J. (2003). Constructing Infinite Words of Intermediate Complexity. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_15
Download citation
DOI: https://doi.org/10.1007/3-540-45005-X_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40431-6
Online ISBN: 978-3-540-45005-4
eBook Packages: Springer Book Archive