Abstract
The algebraic study of formal languages shows that ω-rational languages are exactly the sets recognizable by finite ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context.
More precisely, we first define a reduction relation on finite pointed ω-semigroups by means of a Wadge-like infinite two-player game. The collection of these algebraic structures ordered by this reduction is then proven to be isomorphic to the Wagner hierarchy, namely a decidable and well-founded partial ordering of width 2 and height ω ω.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cabessa, J.: A Game Theoretical Approach to the Algebraic Counterpart of the Wagner Hierarchy. PhD thesis, Universities of Lausanne and Paris 7 (2007)
Carton, O., Perrin, D.: Chains and superchains for ω-rational sets, automata and semigroups. Internat. J. Algebra Comput. 7(6), 673–695 (1997)
Carton, O., Perrin, D.: The Wadge-Wagner hierarchy of ω-rational sets. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 17–35. Springer, Heidelberg (1997)
Carton, O., Perrin, D.: The Wagner hierarchy. Internat. J. Algebra Comput. 9(5), 597–620 (1999)
Duparc, J.: Wadge hierarchy and Veblen hierarchy. I. Borel sets of finite rank. J. Symbolic Logic 66(1), 56–86 (2001)
Duparc, J., Riss, M.: The missing link for ω-rational sets, automata, and semigroups. Internat. J. Algebra Comput. 16(1), 161–185 (2006)
Ladner, R.E.: Application of model theoretic games to discrete linear orders and finite automata. Information and Control 33(4), 281–303 (1977)
Martin, D.A.: Borel determinacy. Ann. of Math (2) 102(2), 363–371 (1975)
McNaughton, R., Papert, S.A.: Counter-Free Automata (M.I.T. research monograph no. 65). MIT Press, Cambridge (1971)
Perrin, D., Pin, J.-E.: First-order logic and star-free sets. J. Comput. System Sci. 32(3), 393–406 (1986)
Perrin, D., Pin, J.-É.: Semigroups and automata on infinite words. In: Semigroups, formal languages and groups (York, 1993), pp. 49–72. Kluwer Acad. Publ., Dordrecht (1995)
Perrin, D., Pin, J.-É.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
Pin, J.-É.: Logic, semigroups and automata on words. Annals of Mathematics and Artificial Intelligence 16, 343–384 (1996)
Pin, J.-E.: Positive varieties and infinite words. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380. Springer, Heidelberg (1998)
Sakarovitch, J.: Monoïdes pointés. Semigroup Forum 18(3), 235–264 (1979)
Schützenberger, M.P.: On finite monoids having only trivial subgroups.. Inf. Control 8, 190–194 (1965)
Selivanov, V.: Fine hierarchy of regular ω-languages. Theoret. Comput. Sci. 191(1-2), 37–59 (1998)
Thomas, W.: Star-free regular sets of ω-sequences. Inform. and Control 42(2), 148–156 (1979)
Wadge, W.W.: Reducibility and determinateness on the Baire space. PhD thesis, University of California, Berkeley (1983)
Wagner, K.: On ω-regular sets. Inform. and Control 43(2), 123–177 (1979)
Wilke, T.: An Eilenberg theorem for ∞-languages. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 588–599. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabessa, J., Duparc, J. (2008). The Algebraic Counterpart of the Wagner Hierarchy. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)