Author:
Fijalkow Nathanaël,Gimbert Hugo,Kelmendi Edon,Kuperberg Denis
Publisher
Springer International Publishing
Reference15 articles.
1. Colcombet, T., Kuperberg, D., Löding, C., Vanden Boom, M.: Deciding the weak definability of Büchi definable tree languages. In: CSL, pp. 215–230 (2013)
2. Colcombet, T., Löding, C.: The nesting-depth of disjunctive
$$\rm \mu $$
-calculus for tree languages and the limitedness problem. In: CSL, pp. 416–430 (2008)
3. Lecture Notes in Computer Science;T Colcombet,2008
4. Cohen, R.S.: Star height of certain families of regular events. J. Comput. Syst. Sci. 4(3), 281–297 (1970)
5. Lecture Notes in Computer Science;T Colcombet,2009