@inproceedings(AK19,
 author       = {{Abu Radi}, B. and O. Kupferman},
 year         = {2019},
 title        = {Minimizing {GFG} Transition-Based Automata},
 booktitle    = {Proc.\ 46th Int. Colloq. on Automata, Languages, and Programming},
 series       = {LIPIcs},
 volume       = {132},
 publisher    = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
 pages        = {100:1--100:16},
 doi          = {10.4230/LIPIcs.ICALP.2019.100},
)
@inproceedings(BK18,
 author       = {M. Bagnol and D. Kuperberg},
 year         = {2018},
 title        = {B{\"{u}}chi Good-for-Games Automata Are Efficiently Recognizable},
 booktitle    = {Proc. 38th Conf. on Foundations of Software Technology and Theoretical Computer Science},
 series       = {LIPIcs},
 volume       = {122},
 publisher    = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
 pages        = {16:1--16:14},
 doi          = {10.4230/LIPIcs.FSTTCS.2018.16},
)
@inproceedings(BKKS13,
 author       = {U. Boker and D. Kuperberg and O. Kupferman and M. Skrzypczak},
 year         = {2013},
 title        = {Nondeterminism in the Presence of a Diverse or Unknown Future},
 booktitle    = {{ICALP} {(2)}},
 series       = {Lecture Notes in Computer Science},
 volume       = {7966},
 publisher    = {Springer},
 pages        = {89--100},
 doi          = {10.1007/978-3-642-39212-2_11},
)
@inproceedings(BKS17,
 author       = {U. Boker and O. Kupferman and M. Skrzypczak},
 year         = {2017},
 title        = {How Deterministic are {G}ood-{F}or-{G}ames Automata?},
 booktitle    = {Proc. 37th Conf. on Foundations of Software Technology and Theoretical Computer Science},
 series       = {Leibniz International Proceedings in Informatics (LIPIcs)},
 volume       = {93},
 pages        = {18:1--18:14},
 doi          = {10.4230/LIPIcs.FSTTCS.2017.18},
)
@inproceedings(Buc62,
 author       = {J.R. B{\"u}chi},
 year         = {1962},
 title        = {On a Decision Method in Restricted Second Order Arithmetic},
 booktitle    = {Proc. Int. Congress on Logic, Method, and Philosophy of Science. 1960},
 publisher    = {Stanford University Press},
 pages        = {1--12},
)
@conference(Col09,
 author       = {Th. Colcombet},
 year         = {2009},
 title        = {The theory of stabilisation monoids and regular cost functions},
 booktitle    = {Proc.\ 36th Int. Colloq. on Automata, Languages, and Programming},
 series       = {Lecture Notes in Computer Science},
 volume       = {5556},
 publisher    = {Springer},
 pages        = {139--150},
 doi          = {10.1007/978-3-642-02930-1_12},
)
@inproceedings(DLFMRX16,
 author       = {Duret-Lutz, A. and A. Lewkowicz and A. Fauchille and Th. Michaud and E. Renault and L. Xu},
 year         = {2016},
 title        = {Spot 2.0 --- a framework for {LTL} and $\omega$-automata manipulation},
 booktitle    = {14th Int. Symp. on Automated Technology for Verification and Analysis},
 series       = {Lecture Notes in Computer Science},
 volume       = {9938},
 publisher    = {Springer},
 pages        = {122--129},
 doi          = {10.1007/978-3-319-46520-3_8},
)
@inproceedings(GL02,
 author       = {D. Giannakopoulou and F. Lerda},
 year         = {2002},
 title        = {From States to Transitions: Improving Translation of {LTL} Formulae to {B}{\"u}chi Automata},
 booktitle    = {Proc. 22nd International Conference on Formal Techniques for Networked and Distributed Systems},
 series       = {Lecture Notes in Computer Science},
 volume       = {2529},
 publisher    = {Springer},
 pages        = {308--326},
 doi          = {10.1007/3-540-36135-9_20},
)
@article(HKR02,
 author       = {T.A. Henzinger and O. Kupferman and S. Rajamani},
 year         = {2002},
 title        = {Fair simulation},
 journal      = {Information and Computation},
 volume       = {173},
 number       = {1},
 pages        = {64--81},
 doi          = {10.1006/inco.2001.3085},
)
@inproceedings(HP06,
 author       = {T.A. Henzinger and N. Piterman},
 year         = {2006},
 title        = {Solving Games without Determinization},
 booktitle    = {Proc. 15th Annual Conf. of the European Association for Computer Science Logic},
 series       = {Lecture Notes in Computer Science},
 volume       = {4207},
 publisher    = {Springer},
 pages        = {394--410},
 doi          = {10.1007/11874683_26},
)
@incollection(Hop71,
 author       = {J.E. Hopcroft},
 year         = {1971},
 title        = {An $n \qopname\relax o{log}n$ algorithm for minimizing the states in a finite automaton},
 editor       = {Z. Kohavi},
 booktitle    = {The Theory of Machines and Computations},
 publisher    = {Academic Press},
 pages        = {189--196},
 doi          = {10.1016/B978-0-12-417750-5.50022-1},
)
@inproceedings(KS15,
 author       = {D. Kuperberg and M. Skrzypczak},
 year         = {2015},
 title        = {On Determinisation of Good-for-Games Automata},
 booktitle    = {Proc.\ 42nd Int. Colloq. on Automata, Languages, and Programming},
 pages        = {299--310},
 doi          = {10.1007/978-3-662-47666-6_24},
)
@article(Kup15,
 author       = {O. Kupferman},
 year         = {2015},
 title        = {Automata Theory and Model Checking},
 journal      = {Handbook of {T}heoretical {C}omputer {S}cience},
)
@article(KSV06,
 author       = {O. Kupferman and S. Safra and M.Y. Vardi},
 year         = {2006},
 title        = {Relating word and tree automata},
 journal      = {Ann. Pure Appl. Logic},
 volume       = {138},
 number       = {1-3},
 pages        = {126--146},
 doi          = {10.1016/j.apal.2005.06.009},
)
@inproceedings(LZ20,
 author       = {K. Lehtinen and M. Zimmermann},
 year         = {2020},
 title        = {Good-for-games {$\omega$}-Pushdown Automata},
 booktitle    = {Proc.\ 35th IEEE Symp. on Logic in Computer Science},
 pages        = {689--702},
 doi          = {10.1145/3373718.3394737},
)
@article(LKH17,
 author       = {W. Li and Sh. Kan and Z. Huang},
 year         = {2017},
 title        = {A Better Translation From {LTL} to Transition-Based Generalized B{\"{u}}chi Automata},
 journal      = {{IEEE} Access},
 volume       = {5},
 pages        = {27081--27090},
 doi          = {10.1109/ACCESS.2017.2773123},
)
@unpublished(Mor03,
 author       = {G. Morgenstern},
 year         = {2003},
 title        = {Expressiveness results at the bottom of the $\omega$-regular hierarchy},
 note         = {{M.Sc.} Thesis, The Hebrew University},
)
@techreport(Myh57,
 author       = {J. Myhill},
 year         = {1957},
 title        = {Finite automata and the representation of events},
 type         = {Technical Report},
 number       = {WADD TR-57-624, pages 112--137},
 institution  = {Wright Patterson AFB},
 address      = {Ohio},
)
@article(Ner58,
 author       = {A. Nerode},
 year         = {1958},
 title        = {Linear Automaton Transformations},
 journal      = {Proceedings of the American Mathematical Society},
 volume       = {9},
 number       = {4},
 pages        = {541--544},
 doi          = {10.2307/2033204},
)
@inproceedings(NW98,
 author       = {D. Niwinski and I. Walukiewicz},
 year         = {1998},
 title        = {Relating hierarchies of word and tree automata},
 booktitle    = {Proc. 15th Symp. on Theoretical Aspects of Computer Science},
 series       = {Lecture Notes in Computer Science},
 volume       = {1373},
 publisher    = {Springer},
 pages        = {320--331},
 doi          = {10.1007/BFb0028571},
)
@inproceedings(Sch10,
 author       = {S. Schewe},
 year         = {2010},
 title        = {{Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete}},
 booktitle    = {Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science},
 series       = {Leibniz International Proceedings in Informatics (LIPIcs)},
 volume       = {8},
 pages        = {400--411},
 doi          = {10.4230/LIPIcs.FSTTCS.2010.400},
)
@article(Sch20,
 author       = {S. Schewe},
 year         = {2020},
 title        = {Minimising Good-for-Games automata is {NP} complete},
 journal      = {CoRR},
 volume       = {abs/2003.11979},
)
@inproceedings(SEJK16,
 author       = {S. Sickert and J. Esparza and S. Jaax and K{\v r}et{\'{\i}}nsk{\'{y}}, J.},
 year         = {2016},
 title        = {Limit-Deterministic B{\"{u}}chi Automata for Linear Temporal Logic},
 booktitle    = {Proc. 28th Int. Conf. on Computer Aided Verification},
 series       = {Lecture Notes in Computer Science},
 volume       = {9780},
 publisher    = {Springer},
 pages        = {312--332},
 doi          = {10.1007/978-3-319-41540-6_17},
)
@article(Tar72,
 author       = {R.E. Tarjan},
 year         = {1972},
 title        = {Depth first search and linear graph algorithms},
 journal      = {SIAM Journal of Computing},
 volume       = {1(2)},
 pages        = {146--160},
 doi          = {10.1137/0201010},
)
@article(VW94,
 author       = {M.Y. Vardi and P. Wolper},
 year         = {1994},
 title        = {Reasoning about Infinite Computations},
 journal      = {Information and Computation},
 volume       = {115},
 number       = {1},
 pages        = {1--37},
 doi          = {10.1006/inco.1994.1092},
)