Rabin vs. Streett automata
From MaRDI portal
Publication:5136307
DOI10.4230/LIPICS.FSTTCS.2017.17zbMATH Open1491.68095OpenAlexW2788732000MaRDI QIDQ5136307FDOQ5136307
Authors: Udi Boker 
Publication date: 25 November 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.17
Recommendations
Cites Work
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Propositional dynamic logic of looping and converse is elementarily decidable
- Title not available (Why is that?)
- Alternating finite automata on \(\omega\)-words
- Alternation removal in Büchi automata
- Testing and generating infinite sequences by a finite automaton
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Büchi complementation made tight
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Translating to Co-Büchi Made Tight, Unified, and Useful
- Title not available (Why is that?)
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tighter analysis of Piterman's Büchi determinization
- Automated Technology for Verification and Analysis
- Determinising Parity Automata
- A tight lower bound for Streett complementation
Cited In (2)
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)
