Emptiness of alternating tree automata using games with imperfect information
We consider the emptiness problem for alternating tree automata, with two acceptance
semantics: classical (all branches are accepted) and qualitative (almost all branches are …
semantics: classical (all branches are accepted) and qualitative (almost all branches are …
[PDF][PDF] Playing with trees and logic
O Serre - 2015 - inria.hal.science
Je voudrais tout d'abord remercier les rapporteurs de ce manuscrit, Pierre-Louis Curien,
Paul Gastin et Damian Niwiński. Ce sont trois scientifiques que je respecte profondément et …
Paul Gastin et Damian Niwiński. Ce sont trois scientifiques que je respecte profondément et …
[HTML][HTML] Counting branches in trees using games
We study finite automata running over infinite binary trees. A run of such an automaton is
usually said to be accepting if all its branches are accepting. In this article, we relax the …
usually said to be accepting if all its branches are accepting. In this article, we relax the …
Emptiness Of Alternating Parity Tree Automata Using Games With Imperfect Information
S Pinchinat, O Serre - 2012 - inria.hal.science
We focus on the emptiness problem for alternating parity tree automata. The usual technique
to tackle this problem first removes alternation, going to non-determinism, and then checks …
to tackle this problem first removes alternation, going to non-determinism, and then checks …
[PDF][PDF] Automata, Logics and Games for Infinite Trees
A Carayol - igm.univ-mlv.fr
This document presents a selection of the contributions obtained since my PhD thesis in
2006 at IRISA in Rennes. This research was conducted during my postdoc in RWTH Aachen …
2006 at IRISA in Rennes. This research was conducted during my postdoc in RWTH Aachen …