Rabin vs. Streett Automata

DOI10.4230/LIPIcs.FSTTCS.2017.17zbMath1491.68095OpenAlexW2788732000MaRDI QIDQ5136307

Udi Boker

Publication date: 25 November 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.17

zbMATH Keywords

translationsstate spaceautomata sizefinite automata on infinite wordsnondeterminsim

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Unnamed Item ⋮ How Deterministic are Good-For-Games Automata?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• A tighter analysis of Piterman's Büchi determinization
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Determinising Parity Automata
• Translating to Co-Büchi Made Tight, Unified, and Useful
• Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
• Alternation Removal in Büchi Automata
• A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
• Propositional dynamic logic of looping and converse is elementarily decidable
• Büchi Complementation Made Tight
• Automated Technology for Verification and Analysis
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Rabin vs. Streett Automata