The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem-Reference-Cited by-同舟云学术

The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem

Published:2008 Issue: Volume: Page:416-430
ISSN:0302-9743
Container-title:Computer Science Logic
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-87531-4_30

Reference9 articles.

1. Bojanczyk, M., Colcombet, T.: Bounds in ω-regularity. In: Proceedings of LICS 2006, pp. 285–296. IEEE Computer Society Press, Los Alamitos (2006)

2. Lecture Notes in Computer Science;T. Colcombet,2007

3. Lecture Notes in Computer Science;T. Colcombet,2008

4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Löding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://tata.gforge.inria.fr

5. Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406–451 (1970)

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

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

2. Games with bound guess actions;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

3. Automata column;ACM SIGLOG News;2015-10-13

4. Star Height via Games;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07

5. Two-way cost automata and cost logics over infinite trees;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14