Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1984: Automata on Infinite Words pp 28–46Cite as

Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme

  • Part I The Theory Of Buchi And McNaughton
  • Conference paper
  • First Online:

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

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. BEAUQUIER D. 1984 Bi-limites de langages reconnaissables (à paraitre dans Theoretical Computer Science).

    Google Scholar 

  2. BEAUQUIER D. PERRIN D. 1984 Codeterministic automata on infinite words (à paraitre dans I.P.L)

    Google Scholar 

  3. EILENBERG S. 1974 Automata, languages dans machines vol. A Academic Press, New York.

    Google Scholar 

  4. NIVAT M. PERRIN D. 1982 Ensembles reconnaissables de mots bi-infinis Proc. 14th ACM Symp. on Theory of Computing 47–59.

    Google Scholar 

  5. PERRIN D. 1984 Recent results on automata and infinite words (à paraitre dans MFCS 84 — Springer).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P. — Université Paris 7, France

    D. Beauquier

Authors
  1. D. Beauquier
    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

Beauquier, D. (1985). Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme. 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_21

Download citation

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

  • 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