Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1996: STACS 96 pp 49–59Cite as

Cyclic languages and strongly cyclic languages

  • Conference paper
  • First Online:

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

Abstract

We prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marie-Pierre Béal. Codage symbolique. Masson, 1993.

    Google Scholar 

  2. Marie-Pierre Béal. Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. R.A.I.R.O.-Informatique Théorique et Applications, 29(2):85–103, 1995.

    Google Scholar 

  3. Rufus Bowen. Symbolic dynamics. In On axiom A diffeomorphism, number 35 in CBMS Reg. Conf. American Mathematical Society, 1978.

    Google Scholar 

  4. Jean Berstel and Dominique Perrin. Theory of codes. Academic Press, 1984.

    Google Scholar 

  5. Jean Berstel and Christophe Reutenauer. Zeta functions of formal languages. Trans. Amer. Math. Soc., 321:533–546, 1990.

    Google Scholar 

  6. Olivier Carton. Mots infinis, ω-semigroupes et topologie. Thèse, Université Paris 7, 1993. Rapport LITP-TH 93-08.

    Google Scholar 

  7. S. Eilenberg. Automata, languages and machines, volume A. Academic Press, New York, 1972.

    Google Scholar 

  8. Gérard Lallement. Semigroups and combinatorial applications. Wiley, 1979.

    Google Scholar 

  9. A. Manning. Axiom A diffeomorphisms have rationnal zeta fonctions. Bull. London Math. Soc., 3:215–220, 1971.

    Google Scholar 

  10. Jean-Eric Pin. Varieties of formal languages. North Oxford, London and Plenum, New-York, 1986. (Traduction de Variétés de langages formels).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP - Institut Blaise Pascal, Université Denis Diderot, 2 Place Jussieu, 75251, Paris cedex 05

    Marie -Pierre Béal

  2. Institut Gaspard Monge, Université de Marne-la-Vallée, 93166, Noisy le Grand cedex

    Olivier Carton

  3. Mathématiques, Université du Québec à Montréal, succ. Centre-Ville, C.P. 8888, H3C 3P8, Montréal, Canada

    Christophe Reutenauer

Authors
  1. Marie -Pierre Béal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Carton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christophe Reutenauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Puech Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Béal, M.P., Carton, O., Reutenauer, C. (1996). Cyclic languages and strongly cyclic languages. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-60922-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49723-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation