1. Bojańczyk, M., Czerwiński, W.: An automata toolbox, February 2018.
https://www.mimuw.edu.pl/~bojan/papers/toolbox-reduced-feb6.pdf
2. Boker, U., Kupferman, O., Skrzypczak, M.: How deterministic are good-for-games automata? In: FSTTCS, pp. 18:1–18:14 (2017)
3. Büchi, J.R., Landweber, L.H.: Definability in the monadic second-order theory of successor. J. Symbolic Logic 34(2), 166–170 (1969)
4. Boker, U., Lehtinen, K.: Register games. Logical Methods Comput. Sci. (Submitted, 2019)
5. Czerwiński, W., Daviaud, L., Fijalkow, N., Jurdziński, M., Lazić, R., Parys, P.: Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. In: SODA, pp. 2333–2349 (2019)