Skip to main content
SpringerLink
Log in

Repetitiveness of D0L-languages is decidable in polynomial time

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

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

  • 90 Accesses

Abstract

We study the repetition of subwords in languages generated by morphisms. First we give a new proof for the fact that such a language is repetitive if and only if it is strongly repetitive (Ehrenfeucht and Rozenberg, 1983). Central to our proof is the notion of quasi-repetitive elements for morphisms. Then, from this proof, we derive a structurally simple polynomial-time algorithm for deciding whether a D0L-language is repetitive.

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. A. Ehrenfeucht and G. Rozenberg. Simplifications of homomorphisms. Information and Control, 38:298–309, 1978.

    Article  Google Scholar 

  2. A. Ehrenfeucht and G. Rozenberg. On the subword complexity of square-free D0L languages. Theoretical Computer Science, 16:25–32, 1981.

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. T. Harju and M. Linna. On the periodicity of morphisms on free monoids. RAIRO Informatique Théorique et Applications, 20:47–54, 1986.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  7. Y. Kobayashi and F. Otto. Repetitiveness of languages generated by morphisms. Preprint No. 2/97, Fachbereich 17, Universität Kassel, 1997.

    Google Scholar 

  8. Y. Kobayashi, F. Otto, and P. Seebold. A complete characterization of repetitive morphisms over the two-letter alphabet. Proceedings of COCOON'97, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997, to appear.

    Google Scholar 

  9. M. Lothaire. Combinatorics on Words. Addison-Wesley, Mass., 1982.

    Google Scholar 

  10. F. Mignosi and P. Seebold. If a D0L 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 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Yuji Kobayash

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

    Friedrich Otto

Authors
  1. Yuji Kobayash
    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

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayash, Y., Otto, F. (1997). Repetitiveness of D0L-languages is decidable in polynomial time. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029977

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation