On various classes of infinite words obtained by iterated mappings

  • Jean-Jacques Pansiot
Part V Iterated Morphisms And Infinite Words
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aršon]
    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 79]
    Berstel (J.). — Mots sans carré et morphismes itérés, Discrete Math., t. 29, 1979, p. 235–244.Google Scholar
  3. [Berstel 84]
    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]
    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 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 and Ullman]
    Hopcroft (J.) and Ullman (J.). — Formal languages and their relation to automata. — Reading, Massachusetts, Addison-Wesley, 1969.Google Scholar
  7. [Lothaire]
    Lothaire (M.). — Combinatorics on words. — Reading, Massachusetts, Addison-Wesley, 1982.Google Scholar
  8. [Pansiot 81]
    Pansiot (J.-J.). — The Morse sequence and iterated morphisms, Information Processing Letters, t. 12, 1981, p. 68–70.Google Scholar
  9. [Pansiot 83]
    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 84]
    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 and Salomaa]
    Rozenberg (G.) and Salomaa (A.). — The Mathematical Theory of L-systems. — New-York, Academic Press, 1980.Google Scholar
  12. [Thue]
    Thue (A.). — Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I, Math.-Nat. Kl., t. 7, 1906, p. 1–22.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Jean-Jacques Pansiot
    • 1
  1. 1.Centre de Calcul de l'EsplanadeUniversité Louis-PasteurStrasbourg CedexFrance

Personalised recommendations