Skip to main content
SpringerLink
Log in

On various classes of infinite words obtained by iterated mappings

  • Part V Iterated Morphisms And Infinite Words
  • Conference paper
  • First Online:
Automata on Infinite Words (LITP 1984)

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

Included in the following conference series:

Abstract

We define sets of infinite words generated by various classes of iterated mappings. We show that every infinite word generated by an extended tag system can also be generated by an ε-free tag system. We give a full inclusion graph and several closure properties for the sets of infinite words considered. We investigate some extensions of tag systems using iterated sequential mappings.

Ce texte a été composé par le Laboratoire de Typographie Informatique de l'Université Louis-Pasteur de Strasbourg, au moyen du logiciel Stratec; le fichier de saisie a ensuite été traité par le logiciel TEX implanté sur l'ordinateur Sm 90. La sortie graphique utilisée est une imprimante Toshiba P 1351, d'une résolution de 180 points par pouce.

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. Aršon (S.). — Démonstration de l'existence de suites asymétriques infinies, Mat.Sb, t. 44, 1937, p. 769–777.

    Google Scholar 

  2. Berstel (J.). — Mots sans carré et morphismes itérés, Discrete Math., t. 29, 1979, p. 235–244.

    Google Scholar 

  3. Berstel (J.). — Some recent results on square free words, Symposium on Theoretical Aspects of Computer Science [Paris. 1984], p. 14–25. Berlin, Springer-Verlag, 1984 (Lecture Notes in Computer Science, 166).

    Google Scholar 

  4. Bleuzen (N.). — Suites points fixes de transductions uniformes, Département de Mathématique Informatique, Université de Marseille,1984, to appear.

    Google Scholar 

  5. [Ehrenfeucht et al] Ehrenfeucht (A.),Lee (K.) and Rozenberg (G.). — Subword complexities of various classes of deterministic developmental languages without interactions, Theoretical Computer Science, t. 1, 1975, p. 59–75.

    Google Scholar 

  6. Hopcroft (J.) and Ullman (J.). — Formal languages and their relation to automata. — Reading, Massachusetts, Addison-Wesley, 1969.

    Google Scholar 

  7. Lothaire (M.). — Combinatorics on words. — Reading, Massachusetts, Addison-Wesley, 1982.

    Google Scholar 

  8. Pansiot (J.-J.). — The Morse sequence and iterated morphisms, Information Processing Letters, t. 12, 1981, p. 68–70.

    Google Scholar 

  9. Pansiot (J.-J.). — Hiérarchie et fermeture de certaines classes de tag-systèmes, Acta Informatica, t. 20, 1983, p. 179–196.

    Google Scholar 

  10. Pansiot (J.-J.). — Complexité des facteurs des mots infinis engendrés par morphismes itérés, International Conference on Automata Language and Programming [Antwerpen. 1984], p. 380–389. — Berlin, Springer-Verlag, 1984 (Lecture Notes in Computer Science, 172).

    Google Scholar 

  11. Rozenberg (G.) and Salomaa (A.). — The Mathematical Theory of L-systems. — New-York, Academic Press, 1980.

    Google Scholar 

  12. Thue (A.). — Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I, Math.-Nat. Kl., t. 7, 1906, p. 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Calcul de l'Esplanade, Université Louis-Pasteur, 7, rue René Descartes, 67084, Strasbourg Cedex, France

    Jean-Jacques Pansiot

Authors
  1. Jean-Jacques Pansiot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Nivat D. Perrin

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pansiot, JJ. (1985). On various classes of infinite words obtained by iterated mappings. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-15641-0_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15641-3

  • Online ISBN: 978-3-540-39505-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation