The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata-Reference-Cited by-同舟云学术

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata

Published: Issue: Volume: Page:398-409
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Colcombet Thomas,Löding Christof

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70583-3_33.pdf

Reference19 articles.

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. Lecture Notes in Computer Science;A. Carayol,2007

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monoidal-closed categories of tree automata;Mathematical Structures in Computer Science;2020-01

2. REGULAR TREE LANGUAGES IN LOW LEVELS OF THE WADGE HIERARCHY;LOG METH COMPUT SCI;2019

3. The Descriptive Complexity of Modal μ Model-checking Games;Electronic Proceedings in Theoretical Computer Science;2017-09-06

4. $$\varSigma ^{\mu }_2$$ is decidable for $$\varPi ^{\mu }_2$$;Unveiling Dynamics and Complexity;2017

5. Stamina: Stabilisation Monoids in Automata Theory;Implementation and Application of Automata;2017