Skip to main content
SpringerLink
Log in

Locally periodic infinite words and a chaotic behaviour

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

Abstract

We call a one-way infinite word w over a finite alphabet (ρ,ρ)-repetitive if all long enough prefixes of w contain as a suffix a repetition of order ρ of a word of length at most p. We show that each (2,4)-repetitive word is ultimately periodic, as well as that there exist nondenumerably many, and hence also nonultimately periodic, (2,5)-repetitive words. Further we characterize nonultimately periodic (2, 5)-repetitive words both structurally and algebraically.

Supported by Academy of Finland under the grant 14047

On leave from Instytut Informatyki UW, Banacha 2, 02-047 Warszawa, Poland.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and D. Perrin, Finite and infinite words, in: M. Lothaire, Algebraic Combinatorics on Words (to appear).

    Google Scholar 

  2. C. Choffrut and J. Karhumäki, Combinatorics of Words, in: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1, Springer, 329–438, 1997.

    Google Scholar 

  3. J. Karhumäki, A. Lepistö and W. Plandowski, Locally Periodic Infinite Words and a Chaotic Behaviour, TUCS Report 133, 1997.

    Google Scholar 

  4. M. Lothaire, Combinatorics on Words, Addison-Wesley, 1983.

    Google Scholar 

  5. F. Mignosi and G. Pirillo, Repetitions in the Fibonacci infinite word, RAIRO Theor. Inform. Appl. 26, 199–204, 1992.

    MATH  MathSciNet  Google Scholar 

  6. F. Mignosi, A. Restivo and S. Salemi, A periodicity theorem on words and applications, in MFCS'95, Springer LNCS 969, 337–348, 1995.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki, Arto Lepistö & Wojciech Plandowski

  2. Turku Centre for Computer Science, Finland

    Juhani Karhumäki, Arto Lepistö & Wojciech Plandowski

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Lepistö
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wojciech Plandowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J., Lepistö, A., Plandowski, W. (1998). Locally periodic infinite words and a chaotic behaviour. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055072

Download citation

  • DOI: https://doi.org/10.1007/BFb0055072

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation