Sciweavers

3 search results - page 1 / 1
» Linear Game Automata: Decidable Hierarchy Problems for Strip...
Sort
View
156
Voted
CSL
2009
Springer
16 years 27 days ago
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
Jacques Duparc, Alessandro Facchini, Filip Murlak
ILC
2007
Springer
16 years 14 days ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini
LICS
2007
IEEE
16 years 18 days ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis