@article{KHOUSSAINOV2009404,
    Abstract = {In this paper, we initiate the study of Ehrenfeucht--Fra{\"\i}ss{\'e} games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call the Ehrenfeucht--Fra{\"\i}ss{\'e} problem. Given n∈{$\omega$} as a parameter, and two relational structures A and B from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game Gn(A,B)? We provide algorithms for solving the Ehrenfeucht--Fra{\"\i}ss{\'e} problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the values of these constants as functions of n.},
    Author = {Khoussainov, Bakhadyr and Liu, Jiamou},
    File = {On complexity of Ehrenfeucht–Fraïssé games - 1-s2.0-S0168007209001493-main (0) - a - a - y.pdf},
    ISSN = {0168-0072},
    Journal = {Annals of Pure and Applied Logic},
    Keywords = {Finite model theory, Ehrenfeucht--Fra{\"\i}ss{\'e} game, Computation complexity},
    Note = {Papers presented at the Symposium on Logical Foundations of Computer Science 2007},
    Number = {3},
    Pages = {404 - 415},
    Title = {On complexity of Ehrenfeucht--Fra{\"\i}ss{\'e} games},
    URL = {http://www.sciencedirect.com/science/article/pii/S0168007209001493},
    Volume = {161},
    Year = {2009},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0168007209001493},
    bdsk-url-2 = {https://doi.org/10.1016/j.apal.2009.07.011},
    date-added = {2019-10-26 12:46:03 +0200},
    date-modified = {2019-10-26 12:46:03 +0200},
    doi = {10.1016/j.apal.2009.07.011}
}

@article{KHOUSSAINOV2009404, Abstract = {In this paper, we initiate the study of Ehrenfeucht--Fra{\"\i}ss{\'e} games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call the Ehrenfeucht--Fra{\"\i}ss{\'e} problem. Given n∈{$\omega$} as a parameter, and two relational structures A and B from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game Gn(A,B)? We provide algorithms for solving the Ehrenfeucht--Fra{\"\i}ss{\'e} problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the values of these constants as functions of n.}, Author = {Khoussainov, Bakhadyr and Liu, Jiamou}, File = {On complexity of Ehrenfeucht–Fraïssé games - 1-s2.0-S0168007209001493-main (0) - a - a - y.pdf}, ISSN = {0168-0072}, Journal = {Annals of Pure and Applied Logic}, Keywords = {Finite model theory, Ehrenfeucht--Fra{\"\i}ss{\'e} game, Computation complexity}, Note = {Papers presented at the Symposium on Logical Foundations of Computer Science 2007}, Number = {3}, Pages = {404 - 415}, Title = {On complexity of Ehrenfeucht--Fra{\"\i}ss{\'e} games}, URL = {http://www.sciencedirect.com/science/article/pii/S0168007209001493}, Volume = {161}, Year = {2009}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0168007209001493}, bdsk-url-2 = {https://doi.org/10.1016/j.apal.2009.07.011}, date-added = {2019-10-26 12:46:03 +0200}, date-modified = {2019-10-26 12:46:03 +0200}, doi = {10.1016/j.apal.2009.07.011} }