Jacques Duparc
On μ-calculus, alternating tree automata, and Wadge reducibility.

Abstract. we are interested in sets of Infinite binary trees that are models of mu-calculus formulas, as well as those that are tree- languages accepted by alternating automata. We show how Wadge games easily settle the strictness of the semantical hierarchy inside Δ12. We investigate the alternation free fragment whose richness extend on all finite Borel levels.

Back to programme