1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Rational ω-languages are non-ambiguous;Arnold;Theoret. Comput. Sci.,1983
3. Equivalence and inclusion problem for strongly unambiguous Büchi automata;Bousquet,2010
4. Unambiguous Büchi automata;Carton;Theoret. Comput. Sci.,2003
5. Complementation, disambiguation, and determinization of Büchi automata unified;Kähler,2008