Rabin vs. Streett automata
From MaRDI portal
Publication:5136307
Recommendations
Cites work
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 1500643 (Why is no real title available?)
- scientific article; zbMATH DE number 1555955 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- A tight lower bound for Streett complementation
- A tighter analysis of Piterman's Büchi determinization
- Alternating finite automata on \(\omega\)-words
- Alternation removal in Büchi automata
- Automated Technology for Verification and Analysis
- Büchi complementation made tight
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Determinising parity automata
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- On the (in)succinctness of Muller automata
- Propositional dynamic logic of looping and converse is elementarily decidable
- Testing and generating infinite sequences by a finite automaton
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Translating to co-Büchi made tight, unified, and useful
Cited in
(5)
This page was built for publication: Rabin vs. Streett automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136307)
