Skip to main content
SpringerLink
Log in
Book cover

International Conference on Infinity in Logic and Computation

ILC 2007: Infinity in Logic and Computation pp 46–55Cite as

A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata

  • Conference paper

  • 218 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5489))

Abstract

Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal μ-calculus extended with backwards modalities. In this paper, we present a very simple proof by way of Wadge games of the strictness of the hierarchy of Motowski indices of two-way alternating automata over trees.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alberucci, L.: Strictness of the Modal μ-Calculus Hierarchy. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 185–201. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Arnold, A.: The μ-Calculus Alternation-Depth Hierarchy is Strict on Binary Trees. Theor. Inform. Appl. 33(4/5), 319–340 (1999)

    Article  Google Scholar 

  3. Arnold, A., Niwinski, D.: Rudiments of μ-Calculus. Studies in Logic, vol. 146. Elsevier, Amsterdam (2001)

    Book  Google Scholar 

  4. Arnold, A., Niwinski, D.: Continuous separation of game languages. Fundamenta Informaticae 81(1-3), 19–28 (2008)

    MathSciNet  Google Scholar 

  5. Bradfield, J.: The Modal μ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195(1), 133–153 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bradfield, J.: Simplifying the Modal μ-Calculus Alternation Hierarchy. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 39–49. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Duparc, J., Facchini, A.: The Topological Complexity of Models of the Modal μ-Calculus – On The Alternation Free Fragment and Beyond (submitted)

    Google Scholar 

  8. Duparc, J., Murlak, F.: On the Topological Complexity of Weakly Recognizable Tree Languages. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 261–273. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Duparc, J.: Wadge Hierarchy and Veblen Hierarchy Part 1: Borel Sets of Finite Rank. J. Symb. Log. 66(1), 56–86 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Emerson, E.A., Jutla, C.S.: Tree Automata, μ-Calculus and Determinacy (Extended Abstract). In: Sipser, M. (ed.) Proc. FOCS 1991, pp. 368–377 (1991)

    Google Scholar 

  11. Grädel, E., Walukiewicz, I.: Guarded fixed point logics. In: Longo, G. (ed.) Proc. LICS 1999, pp. 45–54 (1999)

    Google Scholar 

  12. Henzinger, T.A., Kupferman, O., Qadeer, S.: From prehistoric to postmodern symbolic model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 195–206. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Kupfermann, O., Safra, S., Vardi, M.: Relating Word and Tree Automata. In: Clarke, E.M. (ed.) Proc. LICS 1996, pp. 322–332 (1996)

    Google Scholar 

  14. Mostowski, A.W.: Hierarchies of weak automata and weak monadic formulas. Theor. Comput. Sci. 83, 323–335 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  15. Murlak, F.: On deciding topological classes of deterministic tree languages. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 428–441. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Murlak, F.: The Wadge hierarchy of deterministic tree languages. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 408–419. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Murlak, F.: Weak Index vs. Borel Rank. In: Albers, S., Weil, P., Rochange, C. (eds.) Proc. STACS 2008, pp. 573–584 (2008)

    Google Scholar 

  18. Niwinski, D.: On fixed point clones. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 464–473. Springer, Heidelberg (1986)

    Google Scholar 

  19. Niwinski, D., Walukiewicz, I.: Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electr. Notes Theor. Comput. Sci. 123, 195–208 (2005)

    Article  MathSciNet  Google Scholar 

  20. Vardi, M.Y.: Reasoning about the Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  21. Wadge W.W.: Reducibility and determinateness on the Baire space. Ph.D. Thesis, Berkeley (1984)

    Google Scholar 

  22. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. Elektron. Informationsverarbeitung Kybern. 13, 473–487 (1977)

    MATH  Google Scholar 

  23. Wagner, K.: On ω-regular sets. Inform. and Control 43, 123–177 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  24. Wilke, T.: Alternating Tree Automata, Parity Games, and Modal μ-Calculus. Bul. Belg. Math. Soc. 8(2), 359–391 (2001)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Hautes Études Commerciales, Institut des Systèmes d’information, Université de Lausanne, 1015, Lausanne, Switzerland

    Jacques Duparc & Alessandro Facchini

  2. Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux 1, 351 cours de la Libération, 33405, Talence cedex, France

    Alessandro Facchini

Authors
  1. Jacques Duparc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessandro Facchini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applied Mathematics, University of Cape Town, 7701, Rondebosch, South Africa

    Margaret Archibald  & Vasco Brattka  & 

  2. School of Mathematics, University of the Witwatersrand, Johannesburg, South Africa

    Valentin Goranko

  3. Institute for Logic, Language and Computation, Universiteit van Amsterdam, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duparc, J., Facchini, A. (2009). A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. In: Archibald, M., Brattka, V., Goranko, V., Löwe, B. (eds) Infinity in Logic and Computation. ILC 2007. Lecture Notes in Computer Science(), vol 5489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03092-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03092-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03091-8

  • Online ISBN: 978-3-642-03092-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation