P. A. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar, Computing Simulations over Tree Automata, Proc. of TACAS'08, 2008.
DOI : 10.1007/978-3-540-78800-3_8

P. A. Abdulla, Y. Chen, L. Holík, R. Mayr, and T. Vojnar, When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata), 2010.

A. Bouajjani, P. Habermehl, L. Holík, T. Touili, and T. Vojnar, Antichain-Based Universality and Inclusion Testing over Nondet. Finite Tree Automata, CIAA'08, 2008.

A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar, Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking, TACAS'05, 2005.
DOI : 10.1007/978-3-540-31980-1_2
URL : https://hal.archives-ouvertes.fr/hal-00147978

A. Bouajjani, P. Habermehl, and T. Vojnar, Abstract Regular Model Checking, Proc. of CAV'04, 2004.
DOI : 10.1007/978-3-540-27813-9_29
URL : https://hal.archives-ouvertes.fr/hal-00159512

J. A. Brzozowski, Canonical Regular Expressions and Minimal State Graphs for Definite Events, Mathematical Theory of Automata, 1962.

D. L. Dill, A. J. Hu, and H. Wong-toi, Checking for language inclusion using simulation preorders, Proc. of CAV'92, 1992.
DOI : 10.1007/3-540-55179-4_25

M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995.
DOI : 10.1109/SFCS.1995.492576

L. Holík and J. ?imá?ek, Optimizing an LTS-Simulation Algorithm, Proc. of MEMICS'09, 2009.

J. E. Hopcroft, An n.log n Algorithm for Minimizing States in a Finite Automaton, 1971.

A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, 13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972.
DOI : 10.1109/SWAT.1972.29

M. De-wulf, L. Doyen, T. A. Henzinger, and J. Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, Proc. of CAV'06, 2006.
DOI : 10.1007/11817963_5