Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1984: Automata on Infinite Words pp 1–17Cite as

An introduction to finite automata on infinite words

  • 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. Eilenberg, S., Automata, Languages and Machines, Vol. A, Academic Press, 1974.

    Google Scholar 

  2. Graham, R., Rotschild B. and J. Spencer, Ramsey Theory, Wiley, 1980.

    Google Scholar 

  3. Lallement, G., Semigroups and Combinatorial Applications, Wiley, 1979.

    Google Scholar 

  4. Schutzenberger, M.P., Sur les relations rationnelles fonctionnelles, in Automata, Languages and Programming, M. Nivat ed., North Holland, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris 7, LITP

    Dominique Perrin

Authors
  1. Dominique Perrin
    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

Perrin, D. (1985). An introduction to finite automata on infinite words. 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_19

Download citation

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

  • 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