On the topological complexity of weakly recognizable tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4639 LNCS, Issue , 2007, Pages 261-273

  Duparc, Jacques ^a   Murlak, Filip ^b  

^a UNIVERSITY OF LAUSANNE   (Switzerland)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; SET THEORY; TOPOLOGY;

ALTERNATING AUTOMATA; TOPOLOGICAL COMPLEXITY; TREE LANGUAGES; WADGE HIERARCHY;

FORMAL LANGUAGES;

EID: 38149054794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_23     Document Type: Conference Paper

References (17)

1. Arnold, A., Niwiński, D.: Continuous separation of game languages. Manuscript, 2006 (submitted)
2. Duparc, J.: Wadge hierarchy and Veblen hierarchy. Part I: Borel sets of finite rank. The Journal of Symbolic Logic 66 (2001)
3. Duparc, J.: A hierarchy of deterministic context-free ω-languages. Theoret. Comput. Sci. 290, 1253-1300 (2003)
4. Finkel, O.: Wadge Hierarchy of Omega Context Free Languages. Theoret. Comput. Sci. 269, 283-315 (2001)
5. Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics 156 (1995)
6. Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata. The weak monadic theory of the tree, and its complexity. In: Kott, L. (ed.) Automata, Languages and Programming. LNCS, vol. 226, pp. 275-283. Springer, Heidelberg (1986)
7. 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)
8. 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)
9. Niwiński, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theoret. Comput. Sci. 303, 215-231 (2003)
10. Niwiński, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. In: Proc. WoLLiC 2004. Electronic Notes in Theoret. Comp. Sci., pp. 195-208 (2005)
11. Perrin, D., Pin, J.-E.: Infinite Words. Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
12. Rabin, M.O.: Weakly definable relations and special automata. In: Mathematical Logic and Foundations of Set Theory, North-Holland, pp. 1-70 (1970)
13. Selivanov, V.: Wadge Degrees of ω-languages of deterministic Turing machines. Theoret. Informatics Appl. 37, 67-83 (2003)
14. Skurczyński, J.: The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112, 413-418 (1993)
15. Urbański, T.F.: On deciding if deterministic Rabin language is in Büchi class. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 663-674. Springer, Heidelberg (2000)
16. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13, 473-487 (1977)
17. Wagner, K.: On ω-regular sets. Inform, and Control 43, 123-177 (1979)