Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1989: Fundamentals of Computation Theory pp 416–423Cite as

The Borel hierarchy is infinite in the class of regular sets of trees

  • Conference paper
  • First Online:

  • 148 Accesses

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

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. Büchi, J.R., Landweber, L.H., Definability in the monadic second-order theory of successor, Journal of Symbolic Logic 34 (1969), pp.166–170.

    Google Scholar 

  2. Engelking, R., Holsztyński, W., Sikorski, R., Some examples of Borel sets, Colloquium Mathematicum vol.XV fasc.2 (1966), pp.271–274.

    Google Scholar 

  3. Kuratowski, K., Topology vol. I and II (the translation of the French edition), Academic Press and Polish Scientific Publishers (1966).

    Google Scholar 

  4. Moriya, T., Topological characterizations of infinite tree languages, Theoretical Computer Science 52 (1987), pp. 165–171.

    Article  Google Scholar 

  5. Mostowski, A.W., Finite automata on infinite trees and subtheories of SkS, Les Arbres en Algebre et en Programmation, 5-eme Colloque de Lille (1980), pp.228–240.

    Google Scholar 

  6. Mostowski, A.W., Types of finite automata acceptances and subtheories of SkS, 3rd Symposium on Math. Found. of Comp. Sci., ICS PAS Reports 411 (1980), pp.55–58.

    Google Scholar 

  7. Mostowski, A.W., Hierarchies of weak monadic formulas for two successors arithmetic, J. Inf. Process. Cybern. EIK 23 (1987), pp.509–515.

    Google Scholar 

  8. Muller, D.E., Saoudi, A., Schupp, P., Alternating automata, the weak monadic theory of the tree and its complexity, Proc. 13th ICALP (L.Kott ed), Lect.Notes in Comp. Sci.226 (1986), pp.275–283.

    Google Scholar 

  9. Mostowski, A.W., Skurczyński, J., Wagner, K., Deterministic automata on infinite trees and the Borel hierarchy, Proc. Fourth Hung. Comp. Sci. Conf. (1985), M.Arató, I.Kàtai, L.Varga eds., pp.103–115.

    Google Scholar 

  10. Niwiński, D., The example of non-Borel set of infinite trees recognizable by a Rabin automaton (in Polish), manuscript, Univ.of Warsaw (1985), 9 pages.

    Google Scholar 

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

    Google Scholar 

  12. Rabin, M.O., Weakly definable relations and special automata, Math.Logic and Found. of Set Theory (1970), pp.1–23.

    Google Scholar 

  13. Rabin, M.O., Automata on infinite objects and Church's problem, Regional Conference Series in Mathematics 13 (1972), Amer. Math. Soc., Providence,, Rhode Island.

    Google Scholar 

  14. Skurczyński, J., Automata on infinite trees with conditions for sets of accessible states, unpublished manuscript, Univ. of Gdańsk (1986), 10 pages.

    Google Scholar 

  15. Thomas, W., Automata on infinite objects, in: Handbook of Theoretical Computer Science, North-Holland, to appear.

    Google Scholar 

  16. Wagner, K., On ω-regular sets, Information and Control 43 (1979), pp.123–177.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Merchant Marine Academy, Czerwonych Kosynierów 83, 81-962, Gdynia, Poland

    Jerzy Skurczyński

Authors
  1. Jerzy Skurczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skurczyński, J. (1989). The Borel hierarchy is infinite in the class of regular sets of trees. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation