On the (in)succinctness of Muller automata

DOI10.4230/LIPICS.CSL.2017.12MaRDI QIDQ5111179zbMATH OpenFDO

Authors Udi Boker

Publication date 26 May 2020

zbMATH Keywords

automatadeterminizationomega-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Rabin vs. Streett automata
• Why These Automata Types?
• TYPENESS FOR ω-REGULAR AUTOMATA
• Automated Technology for Verification and Analysis
• On the Succinctness of Nondeterminism

Cited in

(7)

• From Nerode's congruence to suffix automata with mismatches
• Families of DFAs as acceptors of \(\omega\)-regular languages
• Automated Technology for Verification and Analysis
• Rabin vs. Streett automata
• scientific article; zbMATH DE number 2040911 (Why is no real title available?)
• On the Succinctness of Nondeterminism
• TYPENESS FOR ω-REGULAR AUTOMATA

This page was built for publication: On the (in)succinctness of Muller automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111179)