Skip to main content
SpringerLink
Log in

A complete characterization of repetitive morphisms over the two-letter alphabet

  • Session 12: Automata, Languages and Complexity
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

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

Included in the following conference series:

  • 98 Accesses

Abstract

We give a complete characterization for all those morphisms on a two-letter alphabet that are repetitive. Based on this characterization we describe those morphisms on a two-letter alphabet that generate an ultimately periodic infinite word, and those morphisms f for which the languages L(f) or SL(f) are context-free or even regular.

Acknowledgement: The results presented here were obtained while the second author was visiting at Toho University. He gratefully acknowledges the hospitality of the Faculty of Science of Toho University and the support by the Deutsche Forschungsgemeinschaft.

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. Every iterated morphism yields a co-CFL. Information Processing Letters, 22:7–9, 1986.

    Google Scholar 

  2. A. Ehrenfeucht and G. Rozenberg. Repetition of subwords in DOL languages. Information and Control, 59:13–35, 1983.

    Google Scholar 

  3. T. Harju and M. Linna. The equations h(w) = w n in binary alphabets. Theoretical Computer Science, 33:327–329, 1984.

    Google Scholar 

  4. T. Head and B. Lando. Periodic DOL languages. Theoretical Computer Science, 46:83–89, 1986.

    Google Scholar 

  5. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory; Languages; and Computation. Addison-Wesley, Reading, M.A., 1979.

    Google Scholar 

  6. Y. Kobayashi and F. Otto. Repetitiveness of languages generated by morphisms. Mathematische Schriften Kassel 2/97, Universität-GH Kassel, February 1997.

    Google Scholar 

  7. F. Mignosi and P. Séébold. If a DOL language is k-power free then it is circular. In Automata, Languages and Programming, Proceedings of ICALP'93, Lecture Notes in Computer Science 700, pages 507–518. Springer-Verlag, Berlin, 1993.

    Google Scholar 

  8. G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  9. G. Rozenberg and A. Salomaa, editors. Lindenmayer Systems. Springer-Verlag. Berlin, 1992.

    Google Scholar 

  10. P. Séébold. An effective solution to the DOL periodicity problem in the binary case. Bulletin of the EATCS, 36:137–151, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Faculty of Science, Toho University, 274, Funabashi, Japan

    Yuji Kobayashi

  2. Fachbereich Mathematik/Informatik, Universität Kassel, D-34109, Kassel, Germany

    Friedrich Otto

  3. LaRIA, Université de Picardie, Jules Verne 5 rue du Moulin Neuf, F-80000, Amiens, France

    Patrice Séébold

Authors
  1. Yuji Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrice Séébold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, Y., Otto, F., Séébold, P. (1997). A complete characterization of repetitive morphisms over the two-letter alphabet. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045106

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation