scientific article; zbMATH DE number 7561613

DOI10.4230/LIPIcs.ICALP.2019.120MaRDI QIDQ5092321

Anton Pirogov, Christof Löding

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Büchi automatadeterminizationparity automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items

Towards a grand unification of Büchi complementation constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Pillars of computer science. Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday
• An Improved Construction of Deterministic Omega-automaton Using Derivatives
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Tighter Bounds for the Determinisation of Büchi Automata
• Testing and generating infinite sequences by a finite automaton