Skip to main content
SpringerLink
Log in

Recognizable infinite tree sets and their complexity

  • Automata And Formal Languages
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990)

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

Abstract

In this paper we consider the extension of Nerode theorem to infinite trees. Unfortunately, we prove that this extension is not possible. We give some characterisations of Recognizable and Rational ω-tree sets in terms of ω-tree automata. We consider some complexity measures of Recognizable and Rational ω-tree sets and prove that these measures define infinite hierarchies.

Laboratoire d'Informatique Théorique et Programmation. This research was supported by PRC Maths-Info, France.

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.

References

  1. L. Boasson and M. Nivat, "Adherences of context-free languages", J. Comput. Syst. Sci. 20(1980)285–309.

    Google Scholar 

  2. J. R. Büchi, "On a decision method in restricted second order arithmetic", Proc. Cong. Logic in Methodology and Phil. of Sci., Standford University Press, Calif. (1960)1–11.

    Google Scholar 

  3. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, M. Y. Vardi "Decidable Optimization Problems for Database Logic Programs", Proc. 20th ACM Symp. on Theory of Computing (1988)477–490.

    Google Scholar 

  4. B. Courcelle, "Fundamentals of infinite trees", Theoret. Comput. Sci. no. 25(1983)95–169.

    Google Scholar 

  5. A. E. Emerson. "Automata, tableaux, and temporal logics", Proc. Workshop on Logics of Programs, Brooklyn (1985).

    Google Scholar 

  6. A. E. Emerson, and C. Jutla. "The complexity of tree automata and logics of programs", Proc. 29th IEEE Symp. on Foundations of Comput. Sci. (1988)328–336.

    Google Scholar 

  7. Y. Gurevich and L. Harrington, "Trees, Automata, and Games", Proc. 14th ACM Symp. on Theory of Computing (1982)237–263.

    Google Scholar 

  8. T. Hayashi and S. Miyano, "Finite tree automata on infinite trees", Bull. of Informatics and Cybernitics,(1985) 71–82.

    Google Scholar 

  9. D.E. Muller and P. E. Schupp, "Alternating automata on infinite objects,determinancy, and Rabin's theorem", in "Automata on infinite words"(M. Nivat and D. Perrin, eds) LNCS 192(1985)100–107.

    Google Scholar 

  10. D. E. Muller, A. Saoudi, and P. E. Schupp, "Weak alternating Automaton give a Simple Explanation of Why Most Temporal and Dynamic Logic are Decidable in Exponential Time", Proc. of the third IEEE Symposium on Logic in Computer Science(1988).

    Google Scholar 

  11. A. Mostowski, "Determinancy of sinking automata and various Rabin's pair indices", Inf. Proc. Letters 15(1982)153–183.

    Google Scholar 

  12. M. Nivat and A. Saoudi, "Automata on infinite trees and Kleene closure of regular tree sets", Bulletin of the E.A.T.C.S no. 36(1988)131–136.

    Google Scholar 

  13. M. Nivat and A. Saoudi, "Rational, Recognizable and computable languages", Univ. Paris VII, L.I.T.P. publication no. 85–75.

    Google Scholar 

  14. D. Niwinski, "A note on Indices of Rabin's Pairs Automata", manuscript, The University of Warsaw (1986).

    Google Scholar 

  15. R. Parikh. "Propositional Game Logic", Proc. 25th IEEE Symp. on Foundations of Comput. Sci. (1983)195–200.

    Google Scholar 

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

    Google Scholar 

  17. M. O. Rabin, "Weakly definable relations and special automata, Math. Logic and Foundation of set theory", Y.Bar Hillel, Edit. Amsterdam North Holland (1970)1–23.

    Google Scholar 

  18. S. Safra, "On the complexity of ω-automata", Proc. 29th Symp. on Foundations of Computer Sci. (1988)319–327.

    Google Scholar 

  19. A. Saoudi, "Variétés d'automates d'arbres infinis", Theoret. Comput. Sci. 44(1986)1–21.

    Google Scholar 

  20. M. Takahashi, "The greatest fixed point and Rational ω-tree languages", rapport L.I.T.P 85–69.

    Google Scholar 

  21. W. Thomas, "A Hierarchy of sets of infinite trees", G.I Conference, L.N.C.S no 145, Springer-Verlag, Berlin(1982)335–342.

    Google Scholar 

  22. M. Y. Vardi and P. Wolper, "Reasoning about Fair Concurrent programs", Proc. 18th Symp. on Theory of Computing, Berkeley (1986).

    Google Scholar 

  23. M. Y. Vardi. "Verification of Concurrent Programs: The Automata-Theoretic Framework", Logic in Computer Science (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P., Univ. Paris VII, 2, place Jussieu, 75252, Paris, France

    A. Saoudi

  2. Department of Mathematics, Univ. of Illinois at Urbana-Champaign, 1409 West Green street, 61801, Urbana, Illinois, U.S.A.

    D. E. Muller & P. E. Schupp

Authors
  1. A. Saoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. E. Muller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. E. Schupp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saoudi, A., Muller, D.E., Schupp, P.E. (1990). Recognizable infinite tree sets and their complexity. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-53487-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46313-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation