Skip to main content

Alternating automata on infinite objects, determinacy and Rabin's theorem

  • Part III Automata On Infinite Trees
  • Conference paper
  • First Online:
Automata on Infinite Words (LITP 1984)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A.K. Chandra D. Kozen and L. Stockmeyer, Alternation, J.A.C.M. 28 (1981), 114–133.

    Google Scholar 

  2. Y. Gurevich and L. Harrington, Trees, Automata and Games. Proc. ACM STOC May 1982, 60–65.

    Google Scholar 

  3. Y.N. Moschovakis, Descriptive Set Theory, North Holland. Amsterdam, 1980.

    Google Scholar 

  4. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Muller, D., Schupp, P.E. (1985). Alternating automata on infinite objects, determinacy and Rabin's theorem. 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_27

Download citation

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

  • 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