Advertisement

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

  • D. Beauquier
Part I The Theory Of Buchi And McNaughton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)

Keywords

Infinite Word Nous Allons Peut Supposer Premier Facteur Nous Nous Proposons 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    BEAUQUIER D. 1984 Bi-limites de langages reconnaissables (à paraitre dans Theoretical Computer Science).Google Scholar
  2. [2]
    BEAUQUIER D. PERRIN D. 1984 Codeterministic automata on infinite words (à paraitre dans I.P.L)Google Scholar
  3. [3]
    EILENBERG S. 1974 Automata, languages dans machines vol. A Academic Press, New York.Google Scholar
  4. [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. [5]
    PERRIN D. 1984 Recent results on automata and infinite words (à paraitre dans MFCS 84 — Springer).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • D. Beauquier
    • 1
  1. 1.L.I.T.P. — Université Paris 7France

Personalised recommendations