Skip to main content
SpringerLink
Log in

Constructing Infinite Words of Intermediate Complexity

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2450))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jean-Paul Allouche, Sur la complexité des suites inFInies, Bull. Belg. Math. Soc.1 (1994), 133–143.

    MATH  Google Scholar 

  2. 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.

    MathSciNet  MATH  Google Scholar 

  3. Julien Cassaigne, Special factors of sequences with linear subword complexity, in Developments in Language Theory II (DLT∣95), pages 25–34, World Scientific, 1996.

    Google Scholar 

  4. Julien Cassaigne, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc.4 (1997), 67–88.

    MATH  MathSciNet  Google Scholar 

  5. David G. Champernowne, The construction of decimals normal in the scale of ten, J. London Math. Soc.8 (1933), 254–260.

    Article  MATH  Google Scholar 

  6. 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.

    Article  MATH  MathSciNet  Google Scholar 

  7. Christian Grillenberger, Constructions of strictly ergodic systems — I. Given entropy, Z. Wahr. verw. Geb.25 (1973), 323–334.

    Article  MATH  MathSciNet  Google Scholar 

  8. Pascal Hubert, Complexité des suites définies par des billards rationnels, Bull. Soc. Math. France123 (1995), 257–270.

    MATH  MathSciNet  Google Scholar 

  9. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002.

    Google Scholar 

  10. Marston Morse and Gustav A. Hedlund, Symbolic dynamics, Amer. J. Math.60 (1938), 815–866.

    Article  MATH  MathSciNet  Google Scholar 

  11. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques de Luminy, CNRS UPR 9016 / FRUMAMCase 907, 163 avenue de Luminy, F-13288, Marseille cedex 9

    Julien Cassaigne

Authors
  1. Julien Cassaigne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation