On the (in)succinctness of Muller automata
From MaRDI portal
Publication:5111179
Recommendations
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)