RAIRO-Theor. Inf. Appl.
Volume 43, Number 3, July-September 2009
|Page(s)||463 - 515|
|Published online||12 March 2009|
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
University of Lausanne, Faculty of Business and Economics, HEC - ISI, 1015 Lausanne, Switzerland; Jeremie.Cabessa@unil.ch
Accepted: 18 December 2008
The algebraic counterpart of the Wagner hierarchy consists of a well-founded and decidable classification of finite pointed ω-semigroups of width 2 and height ωω. This paper completes the description of this algebraic hierarchy. We first give a purely algebraic decidability procedure of this partial ordering by introducing a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of any ω-rational language can therefore be computed directly on its syntactic image. We then show how to build a finite pointed ω-semigroup of any given Wagner degree. We finally describe the algebraic invariants characterizing every degree of this hierarchy.
Mathematics Subject Classification: O3D55 / 20M35 / 68Q70 / 91A65
Key words: ω-automata / ω-rational languages / ω-semigroups / infinite games / hierarchical games / Wadge game / Wadge hierarchy / Wagner hierarchy.
© EDP Sciences, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.