Half-positional objectives recognized by deterministic Büchi automata
From MaRDI portal
Publication:6597970
DOI10.46298/lmcs-20(3:19)2024MaRDI QIDQ6597970
Pierre Vandenhove, Mickael Randour, [[Person:6124942|Author name not available (Why is that?)]], Patricia Bouyer
Publication date: 4 September 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Büchi automatatwo-player games on graphs\(\omega\)-regularityhalf-positionalitymemoryless optimal strategies
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-cycle games
- Exploring the boundary of half-positionality
- Finite-state \(\omega\)-languages
- On the positional determinacy of edge-labeled games
- Complementing deterministic Büchi automata in polynomial time
- Positional strategies for mean payoff games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Progress measures, immediate determinacy, and a subset construction for tree automata
- On syntactic congruences for \(\omega\)-languages
- Efficient minimization of deterministic weak \(\omega\)-automata
- Energy parity games
- Regular \(\omega\)-languages with an informative right congruence
- Looking at mean-payoff and total-payoff through windows
- Average-energy games
- Playing Safe
- Graph Games and Reactive Synthesis
- Saturating right congruences
- Linear Automaton Transformations
- On Determinisation of Good-for-Games Automata
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Half-Positional Determinacy of Infinite Games
- Omega-Regular Half-Positional Winning Conditions
- On ω-regular sets
- The Theory of Universal Graphs for Infinite Duration Games
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Why These Automata Types?
- Mathematical Foundations of Computer Science 2004
- Random Fruits on the Zielonka Tree
- Church’s Problem and a Tour through Automata Theory
- Decision problems forω-automata
- Definability in the monadic second-order theory of successor
- Testing and generating infinite sequences by a finite automaton
- Depth-First Search and Linear Graph Algorithms
- Stochastic Games
- CONCUR 2005 – Concurrency Theory
- One-to-two-player lifting for mildly growing memory
- On the size of good-for-games Rabin automata and its link with the memory in Muller games
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Characterizing positionality in games of Infinite duration over infinite graphs
This page was built for publication: Half-positional objectives recognized by deterministic Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597970)
