2024-03-29T12:01:32Z
http://repoint.unil.ch/oaiprovider/
oai:serval.unil.ch:BIB_B7FCE719AFD8
2024-03-23T02:53:13Z
serval:BIB_B7FCE719AFD8
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I) The Levels Below ω 1
10.1007/978-3-540-69407-6_22
000256879500022
Duparc
J.
author
Facchini
A.
author
inproceedings
2008
Springer
Logic and Theory of Algorithms : Fourth Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, Proceedings
Beckmann
A.
editor
Dimitracopoulos
C.
editor
Löwe
B.
editor
978-3-540-69405-2
978-3-540-69407-6
Lecture Notes in Computer Science
conference publication
5028
186-195
μ-calculus
Wadge games
Topological complexity
Parity games
Weakly alternating automata
eng
60_published
peer-reviewed