From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
From MaRDI portal
Publication:6566473
DOI10.46298/THEORETICS.24.12MaRDI QIDQ6566473FDOQ6566473
Authors: Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen 
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- Solving parity games in practice
- Practical synthesis of reactive systems from LTL specifications via parity games
- Depth-First Search and Linear Graph Algorithms
- Lexicographic decomposition of \(k\)-valued transducers
- Title not available (Why is that?)
- The Complexity of Tree Automata and Logics of Programs
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parityizing Rabin and Streett
- On the topological complexity of tree languages
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Tighter Bounds for the Determinisation of Büchi Automata
- Topological extension of parity automata
- Explicit Muller games are PTIME
- Unambiguous Büchi automata.
- Random fruits on the zielonka tree
- On ω-regular sets
- Solving Games Without Determinization
- Title not available (Why is that?)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- On the positional determinacy of edge-labeled games
- Saturating right congruences
- A construction on finite automata that has remained hidden
- Improving parity games in practice
- Automata Theory and Model Checking
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Owl: a library for \(\omega \)-words, automata, and LTL
- Graph Games and Reactive Synthesis
- Forms of determinism for automata
- Computing the Rabin Index of a Parity Automaton
- Unambiguity in Automata Theory
- Profile trees for Büchi word automata, with application to determinization
- Structural complexity of ω-automata
- A classification of \(\omega\)-regular languages
- TYPENESS FOR ω-REGULAR AUTOMATA
- Temporal Logic and Fair Discrete Systems
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Title not available (Why is that?)
- Deciding parity games in quasipolynomial time
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Determinising Parity Automata
- Why These Automata Types?
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Index appearance record with preorders
- Index Appearance Record for Transforming Rabin Automata into Parity Automata
- Title not available (Why is that?)
- On Determinisation of Good-for-Games Automata
- Title not available (Why is that?)
- Nondeterminism in the Presence of a Diverse or Unknown Future
- How Deterministic are Good-For-Games Automata?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical “Paritizing” of Emerson-Lei Automata
- From Spot 2.0 to Spot 2.10: What’s New?
- Practical applications of the alternating cycle decomposition
- On the size of good-for-games Rabin automata and its link with the memory in Muller games
- Half-positional objectives recognized by deterministic Büchi automata
- Natural colors of Infinite words
This page was built for publication: From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566473)
