Making Streett Determinization Tight

DOI10.1145/3373718.3394757MaRDI QIDQ5145686zbMATH OpenOpenAlexFDO

Authors

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.16476

zbMATH Keywords

determinizationlower boundRabin automatastate complexityStreett automata

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(1)

• Complementation of Emerson-Lei automata

This page was built for publication: Making Streett Determinization Tight

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