@inproceedings{HolikEtAl:ATVA:2011,
    Address = {Berlin, Heidelberg},
    Author = {Hol{\'\i}k, Luk{\'a}{\v{s}} and Leng{\'a}l, Ond{\v{r}}ej and {\v{S}}im{\'a}{\v{c}}ek, Ji{\v{r}}{\'\i} and Vojnar, Tom{\'a}{\v{s}}},
    BookTitle = {Proc. of ATVA'11},
    Editor = {Bultan, Tevfik and Hsiung, Pao-Ann},
    File = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (0) (0) - a - a - t.pdf},
    ISBN = {978-3-642-24372-1},
    Keywords = {antichain algorithms and tree automata},
    Pages = {243--258},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata},
    URL = {http://dx.doi.org/10.1007/978-3-642-24372-1\_18},
    Year = {2011},
    bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-24372-1\_18},
    date-added = {2017-01-17 10:33:51 +0000},
    date-modified = {2017-01-22 09:36:06 +0000},
    file-2 = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (1) (0) - a - a - t.pdf},
    file-3 = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (2) (0) - a - a - t.pdf},
    doi = {10.1007/978-3-642-24372-1_18}
}

@inproceedings{HolikEtAl:ATVA:2011, Address = {Berlin, Heidelberg}, Author = {Hol{\'\i}k, Luk{\'a}{\v{s}} and Leng{\'a}l, Ond{\v{r}}ej and {\v{S}}im{\'a}{\v{c}}ek, Ji{\v{r}}{\'\i} and Vojnar, Tom{\'a}{\v{s}}}, BookTitle = {Proc. of ATVA'11}, Editor = {Bultan, Tevfik and Hsiung, Pao-Ann}, File = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (0) (0) - a - a - t.pdf}, ISBN = {978-3-642-24372-1}, Keywords = {antichain algorithms and tree automata}, Pages = {243--258}, Publisher = {Springer Berlin Heidelberg}, Title = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata}, URL = {http://dx.doi.org/10.1007/978-3-642-24372-1_18}, Year = {2011}, bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-24372-1_18}, date-added = {2017-01-17 10:33:51 +0000}, date-modified = {2017-01-22 09:36:06 +0000}, file-2 = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (1) (0) - a - a - t.pdf}, file-3 = {Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (pp 243--258) - Holík, Lengál, Simácek, Vojnar (2) (0) - a - a - t.pdf}, doi = {10.1007/978-3-642-24372-1_18} }