Skip to main content
SpringerLink
Log in

Hiérarchie et fermeture de certaines classes de tag-systèmes

Hierarchy and closure properties of various classes of tag-systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Resumé

Nous définissons des ensembles de mots infinis engendrés par différentes classes de tag-systèmes. Nous montrons que tout mot infini engendré par tag-système étendu peut être engendré par tag-système ɛ-free. Nous en déduisons un graphe complet d'inclusion et diverses propriétés de fermeture pour les ensembles de mots infinis considérés.

Summary

We define sets of infinite words generated by various classes of tag-systems. We show that every infinite word generated by extended tag-system can also be generated by ɛ-free tag-system. We give a full inclusion graph and several closure properties for the sets of infinite words under study.

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.

Institutional subscriptions

Bibliographie

  1. Aršon, S.: Démonstration de l'existence de suites asymétriques infinies. Mat. Sb. 44, 769–777 (1937)

    Google Scholar 

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

    Google Scholar 

  3. Cobham, A.: Uniform Tag Sequences. Math. Systems Theory 6, 164–192 (1972)

    Google Scholar 

  4. Entringer, R.C., Jackson, D.E., Schatz, J.A.: On Nonrepetitive Sequences. J. Combinatorial Theory (A) 16, 159–164 (1974)

    Google Scholar 

  5. Ehrenfeucht, A., Lee, K., Rozenberg, G.: Subword complexities of various classes of deterministic developmental languages without interactions. Theor. Comput. Sci. 1, 59–75 (1975)

    Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: On subword complexities of homomorphic images of languages. R.A.I.R.O. Informat. Théor. 16, 303–316 (1982)

    Google Scholar 

  7. Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford University Press 1971

  8. Lothaire: Combinatorics on words. Reading, MA: Addison Wesley 1982

    Google Scholar 

  9. Pansiot, J.J.: The Morse sequence and iterated morphisms. Information Processing Lett. 12, 68–70 (1981)

    Google Scholar 

  10. Pansiot, J.J.: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, Preprint: Séminaire d'Informatique Centre de Calcul de l'Esplanade, Université Louis Pasteur de Strasbourg, juin 1982. A paraître dans Discrete Applied Mathematics

  11. Rozenberg, G., 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, Mat.-Nat. Kl. 7, 1–22 (1906)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jean-Jacques Pansiot

Authors
  1. Jean-Jacques Pansiot
    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

Pansiot, JJ. Hiérarchie et fermeture de certaines classes de tag-systèmes. Acta Informatica 20, 179–196 (1983). https://doi.org/10.1007/BF00289415

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation