A tighter analysis of Piterman's Büchi determinization
From MaRDI portal
(Redirected from Publication:989532)
Recommendations
- Tighter Bounds for the Determinisation of Büchi Automata
- A modular approach for Büchi determinization
- Implementation and Application of Automata
- Observations on determinization of Büchi automata
- A Buchsbaum theory for tight closure
- Determinization of Büchi-Automata
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
- Determinization of Büchi automata: unifying the approaches of Safra and Muller-Schupp
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- The logical strength of Büchi's decidability theorem
Cites work
- scientific article; zbMATH DE number 1500643 (Why is no real title available?)
- Automated Technology for Verification and Analysis
- Büchi complementation made tight
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Testing and generating infinite sequences by a finite automaton
- Tighter Bounds for the Determinisation of Büchi Automata
Cited in
(8)- Tight bounds for complementing parity automata
- Profile trees for Büchi word automata, with application to determinization
- Tighter Bounds for the Determinisation of Büchi Automata
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- A modular approach for Büchi determinization
- Rabin vs. Streett automata
- Profile trees for Büchi word automata, with application to determinization
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
This page was built for publication: A tighter analysis of Piterman's Büchi determinization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989532)
