Skip to main content

On the Periodicity of Morphic Words

  • Conference paper
Developments in Language Theory (DLT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6224))

Included in the following conference series:

Abstract

Given a morphism h prolongable on a and an integer p, we present an algorithm that calculates which letters occur infinitely often in congruent positions modulo p in the infinite word h ω(a). As a corollary, we show that it is decidable whether a morphic word is ultimately p-periodic. Moreover, using our algorithm we can find the smallest similarity relation such that the morphic word is ultimately relationally p-periodic. The problem of deciding whether an automatic sequence is ultimately weakly R-periodic is also shown to be decidable.

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

Access this chapter

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. Allouche, J.-P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci. 410, 2795–2803 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Allouche, J.-P., Shallit, J.: Automatic sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Césari, Y., Vincent, M.: Une caractérisation des fonctions périodiques. C. R. Acad. Sci. Paris 286(A), 1175–1177 (1978)

    MATH  Google Scholar 

  4. Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164–192 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  5. Duval, J.-P.: Périodes et répétitions des mots du monoïde libre. Theoret. Comput. Sci. 9, 17–26 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc. 16, 109–114 (1965)

    MATH  MathSciNet  Google Scholar 

  7. Halava, V., Harju, T., Kärki, T.: Interaction properties of relational periods. Discrete Math. Theor. Comput. Sci. 10, 87–112 (2008)

    MATH  Google Scholar 

  8. Harju, T., Linna, M.: On the periodicity of morphisms on free monoids. Theoret. Inform. Appl. 20, 47–54 (1986)

    MATH  MathSciNet  Google Scholar 

  9. Hedlund, G.A., Morse, M.: Symbolic dynamics II: Sturmian trajectories. Amer. J. Math. 62, 1–42 (1940)

    Article  MathSciNet  Google Scholar 

  10. Honkala, J.: A decision method for the recognizability of sets defined by number systems. Theoret. Inform. Appl. 20, 395–403 (1986)

    MATH  MathSciNet  Google Scholar 

  11. Mignosi, F., Restivo, A.: Periodicity. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 90, pp. 269–311. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  12. Pansiot, J.-J.: Decidability of periodicity for infinite words. Theoret. Inform. Appl. 20, 43–46 (1986)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halava, V., Harju, T., Kärki, T., Rigo, M. (2010). On the Periodicity of Morphic Words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics