The non-deterministic Mostowski hierarchy and distance-parity automata

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 398-409

  Colcombet, Thomas ^a   Löding, Christof ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COSTS; FINANCE; LINGUISTICS; QUERY LANGUAGES; ROBOTS; TRANSLATION (LANGUAGES);

DISTANCE DESERT AUTOMATA; INFINITE TREES; NATURAL NUMBERS; NEW MODEL; TREE LANGUAGES; UNIVERSALITY PROBLEM;

AUTOMATA THEORY;

EID: 49049101901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_33     Document Type: Conference Paper

References (19)

1. Arnold, A.: The μ-calculus alternation-depth hierarchy is strict on binary trees. Informatique Théorique et Applications 33(4/5), 329-340 (1999)
2. Arnold, A., Duparc, J., Murlak, F., Niwiński, D.: On the topological complexity of tree languages. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and automata: History and Perspectives, pp. 9-28. Amsterdam University Press (2007)
3. Bojańczyk, M., Colcombet, T.: Bounds in ω-regularity. In: Proceedings of LICS 2006, pp. 285-296. IEEE Computer Society Press, Los Alamitos (2006)
4. Bradfield, J.C.: The modal μ-calculus alternation hierarchy is strict. Theor. Comput. Sci. 195(2), 133-153 (1998)
5. Carayol, A., Löding, C.: MSO on the infinite binary tree: Choice and order. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 161-176. Springer, Heidelberg (2007)
6. Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124-169 (1988)
7. Kirsten, D.: Distance desert automata and the star height problem. RAIRO - Theoretical Informatics and Applications 3(39), 455-509 (2005)
8. Klarlund, N.: Progress measures, immediate determinacy, and a subset construction for tree automata. Annals of Pure and Applied Logic 69(2-3), 243-268 (1994)
9. Lenzi, G.: A hierarchy theorem for the μ-calculus. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 87-97. Springer, Heidelberg (1996)
10. Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157-168. Springer, Heidelberg (1985)
11. Niwiński, D.: On fixed-point clones. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 464-473. Springer, Heidelberg (1986)
12. Niwiński, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees (unpublished note)
13. Niwiński, D., Walukiewicz, I.: Relating hierarchies of word and tree automata. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 320-331. Springer, Heidelberg (1998)
14. Niwiński, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. Electr. Notes Theor. Comput. Sci. 123, 195-208 (2005)
15. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1-35 (1969)
16. Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol. III, pp. 389-455. Springer, Heidelberg (1997)
17. 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)
18. Wagner, K.W.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13(9), 473-487 (1977)
19. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200(1-2), 135-183 (1998)