Skip to main content
SpringerLink
Log in

Alternating automata, the weak monadic theory of the tree, and its complexity

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. D.E. Muller and P.E. Schupp, The theory of ends. pushdown automata and second-order logic, Theoretical Computer Science 37, (1985).

    Google Scholar 

  2. D.E. Muller and P.E. Schupp, Alternating automata on infinite objects and Rabin's theorem, submitted to Theoretical Computer Science.

    Google Scholar 

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

    Google Scholar 

  4. M.O. Rabin, Weakly definable relations and special automata, Math. Logic and Foundations of Set Theory, North-Holland. 1972, 1–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois, University of Texas, USA

    David E. Muller

  2. Université Paris 13, USA

    Ahmed Saoudi

  3. University of Illinois, Université Paris 7, USA

    Paul E. Schupp

Authors
  1. David E. Muller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmed Saoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul E. Schupp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Muller, D.E., Saoudi, A., Schupp, P.E. (1986). Alternating automata, the weak monadic theory of the tree, and its complexity. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation