Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Alternating finite automata on \(\omega\)-words
An asymptotic equivalent for the number of total preorders on a finite set
Alternating automata, the weak monadic theory of trees and its complexity
Unambiguous Büchi automata.
Complementation of finitely ambiguous Büchi automata
Theoretical aspects of computing -- ICTAC 2019. 16th international colloquium, Hammamet, Tunisia, October 31 -- November 4, 2019. Proceedings
From LTL to unambiguous Büchi automata via disambiguation of alternating automata
On complementing unambiguous automata and graphs with many cliques and cocliques
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
Weak alternating automata are not that weak
Alternation Removal in Büchi Automata
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
Operations on Unambiguous Finite Automata
Improved Upper and Lower Bounds for Büchi Disambiguation
Computer Aided Verification
LTL Model Checking of Interval Markov Chains
Büchi Complementation Made Tight
DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
On the power of finite ambiguity in Büchi complementation
Markov chains and unambiguous automata
Foundations of software science and computation structures. 25th international conference, FOSSACS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings

This page was built for publication: Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata