Can nondeterminism help complementation?

MaRDI QIDQ4986505zbMATH OpenFDO

Authors

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1110.5942, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2012.5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
• Determinization and Complementation of Streett Automata
• Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
• Tight upper bounds for Streett and parity complementation
• scientific article; zbMATH DE number 4179361

Cited in

(2)

• Tight upper bounds for Streett and parity complementation
• Discounted-sum automata with real-valued discount factors

This page was built for publication: Can nondeterminism help complementation?

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