P. A. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar, Computing simulations over tree automata, TACAS'08, pp.93-108, 2008.
DOI : 10.1007/978-3-540-78800-3_8
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-78800-3_8.pdf

J. R. , On a decision method in restricted second order arithmetic, Proc. Congress on Logic, pp.1-12, 1962.

B. S. Chlebus, Domino-tiling games, Journal of Computer and System Sciences, vol.32, pp.374-392, 1986.
DOI : 10.1016/0022-0000(86)90036-x
URL : https://doi.org/10.1016/0022-0000(86)90036-x

L. Clemente and R. Mayr, Advanced automata minimization, POPL'13, pp.63-74, 2013.

V. Diekert and G. Rozenberg, The book of traces, 1995.

D. L. Dill, A. J. Hu, and H. Wong-toi, Checking for language inclusion using simulation relations, CAV'91, pp.255-265, 1992.

E. A. Emerson and C. S. Jutla, Tree automata, µ-calculus and determinacy, FOCS'91, pp.368-377, 1991.
DOI : 10.1109/sfcs.1991.185392

K. Etessami, A hierarchy of polynomial-time computable simulations for automata, CONCUR'02, pp.131-144, 2002.

K. Etessami, T. Wilke, and R. A. Schuller, Fair simulation relations, parity games, and state space reduction for B ¨ uchi automata, pp.694-707, 2001.
DOI : 10.1007/3-540-48224-5_57

O. Finkel, Three applications to rational relations of the high undecidability of the infinite Post Correspondence Problem in a regular ?-language, Int. J. Found. Comput. Sci, vol.23, issue.7, pp.1481-1498, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00543309

C. Fritz and T. Wilke, Simulation relations for alternating B ¨ uchi automata, Theor. Comput. Sci, vol.338, issue.1-3, pp.275-314, 2005.
DOI : 10.1016/j.tcs.2005.01.016
URL : https://doi.org/10.1016/j.tcs.2005.01.016

D. Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, J. ACM, vol.33, issue.1, pp.224-248, 1986.
DOI : 10.1145/4904.4993
URL : http://www.wisdom.weizmann.ac.il/~dharel/SCANNED.PAPERS/EffectiveTransformations.pdf

T. A. Henzinger, O. Kupferman, and S. K. Rajamani, Fair simulation, Inf. Comput, vol.173, issue.1, pp.64-81, 2002.

M. Holtmann, L. Kaiser, and W. Thomas, Degrees of lookahead in regular infinite games, Log. Meth. in Comp. Sci, vol.8, issue.3, 2012.

M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, and . Lozes, Multi-buffer simulations for trace language inclusion, pp.213-227, 2016.

, Two-buffer simulation games, CASSTING'16, pp.27-38, 2016.

M. Hutagalung, M. Lange, and . Lozes, Revealing vs. concealing: More simulation games for B ¨ uchi inclusion, LATA'13, pp.347-358, 2013.

M. Hutagalung, M. Lange, and E. Lozes, Buffered simulation games for B ¨ uchi automata, AFL'14, pp.286-300, 2014.

M. Jurdzí, Small progress measures for solving parity games, STACS'00, pp.290-301, 2000.

R. Milner, An algebraic definition of simulation between programs, IJCAI'71, pp.481-489, 1971.

H. Rogers, Theory of recursive functions and effective computability (reprint from 1967), 1987.

J. Sakarovitch, The "last" decision problem for rational trace languages, pp.460-473, 1992.

P. Van-emde and . Boas, The convenience of tilings, Complexity, Logic, and Recursion Theory, pp.331-363, 1997.