@incollection{Segoufin:CSL06,
    Author = {Segoufin, Luc},
    BookTitle = {Computer Science Logic},
    Editor = {{\'E}sik, Zolt{\'a}n},
    File = {Automata and Logics for Words and Trees over an Infinite Alphabet - Segoufin (0) (0) - a - a - j.pdf},
    ISBN = {978-3-540-45458-8},
    Keywords = {survey},
    Language = {English},
    Pages = {41-57},
    Publisher = {Springer Berlin Heidelberg},
    Series = {Lecture Notes in Computer Science},
    Title = {Automata and Logics for Words and Trees over an Infinite Alphabet},
    URL = {http://dx.doi.org/10.1007/11874683\_3},
    Volume = {4207},
    Year = {2006},
    bdsk-url-1 = {http://dx.doi.org/10.1007/11874683\_3},
    date-added = {2015-03-03 11:03:05 +0000},
    date-modified = {2019-04-13 09:35:52 +0200},
    doi = {10.1007/11874683_3}
}

@incollection{Segoufin:CSL06, Author = {Segoufin, Luc}, BookTitle = {Computer Science Logic}, Editor = {{\'E}sik, Zolt{\'a}n}, File = {Automata and Logics for Words and Trees over an Infinite Alphabet - Segoufin (0) (0) - a - a - j.pdf}, ISBN = {978-3-540-45458-8}, Keywords = {survey}, Language = {English}, Pages = {41-57}, Publisher = {Springer Berlin Heidelberg}, Series = {Lecture Notes in Computer Science}, Title = {Automata and Logics for Words and Trees over an Infinite Alphabet}, URL = {http://dx.doi.org/10.1007/11874683_3}, Volume = {4207}, Year = {2006}, bdsk-url-1 = {http://dx.doi.org/10.1007/11874683_3}, date-added = {2015-03-03 11:03:05 +0000}, date-modified = {2019-04-13 09:35:52 +0200}, doi = {10.1007/11874683_3} }