A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I
From MaRDI portal
Publication:5321775
DOI10.1051/ita/2009004zbMath1175.03021MaRDI QIDQ5321775
Jacques Duparc, Jérémie Cabessa
Publication date: 15 July 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92924
infinite games; Wadge hierarchy; \(\omega\)-automata; hierarchical games; Wadge game; \(\omega\)-semigroups; Wagner hierarchy; \(\omega\)-rational languages
91A65: Hierarchical games (including Stackelberg games)
03E15: Descriptive set theory
03D05: Automata and formal grammars in connection with logical questions
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order logic and star-free sets
- Fine hierarchy of regular \(\omega\)-languages
- Monoides pointes
- Borel determinacy
- Equivalence between Wadge and Lipschitz determinacy
- Logic, semigroups and automata on words
- Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
- On ω-regular sets
- Application of model theoretic games to discrete linear orders and finite automata
- Star-free regular sets of ω-sequences
- Chains and Superchains for ω-Rational Sets, Automata and Semigroups
- THE WAGNER HIERARCHY
- The Wadge-Wagner hierarchy of ω-rational sets
- On finite monoids having only trivial subgroups
- THE MISSING LINK FOR ω-RATIONAL SETS, AUTOMATA, AND SEMIGROUPS