Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata

Details

Ressource 1Download: BIB_1B41D2F54A21.P001.pdf (232.51 [Ko])
State: Public
Version: author
Serval ID
serval:BIB_1B41D2F54A21
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Title of the conference
Computer Science Logic: 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings
Author(s)
Duparc J., Facchini A., Murlak F.
Publisher
Springer
ISBN
978-3-642-04026-9
Publication state
Published
Issued date
2009
Peer-reviewed
Oui
Editor
Grädel E., Kahle R.
Volume
5771
Series
Lecture Notes in Computer Science
Pages
225-239
Language
english
Abstract
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (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: (ω^ω)^ω.
Keywords
Linear tree automata, Wadge Hierarchy, Index Problem, Borel Hierarchy
Web of science
Create date
21/09/2009 11:09
Last modification date
20/08/2019 12:52
Usage data