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, when it comes to non-deterministic tree automata, none of these hierarchies is even close to be understood. Here we make an attempt in paving the way towards a clear understanding of tree automata. We concentrate on the class of linear game automata (LGA), and prove within this new context, that all corresponding hierarchies mentioned above—Mostowski-Rabin, Borel, and Wadge—are decidable. The class LGA is obtained by taking linear tree automata with alternation restricted to the choice of path in the input tree. Despite their simplicity, LGA recognize sets of arbitrary high Borel rank. The actual richness of LGA is revealed by the height of their Wadge hierarchy: (ωω )ω .

• Type: Conference
• Year: 2009
• Where: CSL
• Authors: Jacques Duparc, Alessandro Facchini, Filip Murlak
• Keywords: Artificial Intelligence, CSL 2009, Deterministic Tree Automata, Tree Automata, Wadge Hierarchy