From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism

Cites work

scientific article; zbMATH DE number 3960988 (Why is no real title available?)
scientific article; zbMATH DE number 3990873 (Why is no real title available?)
scientific article; zbMATH DE number 1136070 (Why is no real title available?)
scientific article; zbMATH DE number 1136080 (Why is no real title available?)
scientific article; zbMATH DE number 1973991 (Why is no real title available?)
scientific article; zbMATH DE number 7455738 (Why is no real title available?)
scientific article; zbMATH DE number 7561613 (Why is no real title available?)
scientific article; zbMATH DE number 7577580 (Why is no real title available?)
scientific article; zbMATH DE number 3237829 (Why is no real title available?)
scientific article; zbMATH DE number 7649927 (Why is no real title available?)
scientific article; zbMATH DE number 7830368 (Why is no real title available?)
scientific article; zbMATH DE number 7799616 (Why is no real title available?)
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
A classification of \(\omega\)-regular languages
A construction on finite automata that has remained hidden
Automata theory and model checking
Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
Computing the Rabin Index of a Parity Automaton
Deciding parity games in quasipolynomial time
Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
Depth-First Search and Linear Graph Algorithms
Determinising parity automata
Explicit Muller games are PTIME
Forms of determinism for automata
From LTL and limit-deterministic Büchi automata to deterministic parity automata
From Spot 2.0 to Spot 2.10: What’s New?
Graph Games and Reactive Synthesis
Half-positional objectives recognized by deterministic Büchi automata
How deterministic are good-for-games automata?
Improving parity games in practice
Index appearance record for transforming Rabin automata into parity automata
Index appearance record with preorders
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Infinite games played on finite graphs
LTL to deterministic Emerson-Lei automata
Lexicographic decomposition of \(k\)-valued transducers
Natural colors of Infinite words
Nondeterminism in the presence of a diverse or unknown future
On Determinisation of Good-for-Games Automata
On the positional determinacy of edge-labeled games
On the size of good-for-games Rabin automata and its link with the memory in Muller games
On the topological complexity of tree languages
On ω-regular sets
Owl: a library for \(\omega \)-words, automata, and LTL
Parityizing Rabin and Streett
Practical applications of the alternating cycle decomposition
Practical synthesis of reactive systems from LTL specifications via parity games
Practical “Paritizing” of Emerson-Lei Automata
Profile trees for Büchi word automata, with application to determinization
Progress measures, immediate determinacy, and a subset construction for tree automata
Random fruits on the zielonka tree
Saturating right congruences
Solving Games Without Determinization
Solving parity games in practice
Structural complexity of \(\omega\)-automata
TYPENESS FOR ω-REGULAR AUTOMATA
Temporal logic and fair discrete systems
Testing and generating infinite sequences by a finite automaton
The Complexity of Tree Automata and Logics of Programs
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
The Theory of Stabilisation Monoids and Regular Cost Functions
Tighter Bounds for the Determinisation of Büchi Automata
Topological extension of parity automata
Unambiguity in automata theory
Unambiguous Büchi automata.
Why These Automata Types?

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)