Skip to main content
SpringerLink
Log in

Recurrent words for substitution

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A wordw is called recurrent with respect to a substitution if any descendant of it can regeneratew itself by iterations of the substitution. The set of recurrent words with respect to a regular (resp. context free) substitution is a regular (resp. context free) language. The set of recurrent words which are the descendants of a single fixed word with respect to a context free substitution is context free.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. A. Harrison,Introduction to Formal Language Theory, Addison-Wesley, Menlo Park, 1978.

    Google Scholar 

  2. G. T. Herman and A. Walker, Context free languages in biological systems,Inter. J. of Computer Math., 4, 369–391 (1975).

    Google Scholar 

  3. Y. Kobuchi, Stability of desynchronized OL system,Inform. Proc. Letters, 17, 85–90 (1983).

    Google Scholar 

  4. J. Král, A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context free,Math. Systems Theory, 4, 129–139 (1970).

    Google Scholar 

  5. T. Nishida and Y. Kobuchi, Stability in OL systems,Inter. J. of Computer Math., 13, 105–115 (1983).

    Google Scholar 

Download references

Author information

Author notes

  1. Taishin Nishida

    Present address: International Institute for Advanced Study of Social Information Science, Fujitsu Limited, Numazu, Japan

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et Programmation, C.N.R.S., Paris, France

    Jacques Sakarovitch

  2. Department of Biophysics, Faculty of Science, Kyoto University, Kyoto, Japan

    Taishin Nishida & Youichi Kobuchi

Authors
  1. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taishin Nishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Youichi Kobuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sakarovitch, J., Nishida, T. & Kobuchi, Y. Recurrent words for substitution. Math. Systems Theory 17, 199–215 (1984). https://doi.org/10.1007/BF01744441

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation