@inproceedings{KnapikNiwinskiUrzyczyn:Easy:2002,
    Author = {Knapik, Teodor and Niwi{\'n}ski, Damian and Urzyczyn, Pawe{\l}},
    BookTitle = {Proc. of FOSSACS'02},
    File = {Higher-Order Pushdown Trees Are Easy - Knapik, Niwiński, Urzyczyn (0) (0) - a - a - x.pdf},
    Keywords = {higher-order pushdown automata and higher-order recursion schemes},
    Pages = {205--222},
    Series = {LNCS},
    Title = {Higher-Order Pushdown Trees Are Easy},
    Volume = {2303},
    Year = {2002},
    bdsk-url-1 = {http://www.springerlink.com/content/mj6j536kckepbqdw/fulltext.pdf},
    bdsk-url-2 = {http://dx.doi.org/10.1007/3-540-45931-6\_15},
    date-added = {2012-03-06 11:38:24 +0100},
    date-modified = {2014-05-19 11:07:16 +0000},
    doi = {10.1007/3-540-45931-6_15}
}

@inproceedings{KnapikNiwinskiUrzyczyn:Easy:2002, Author = {Knapik, Teodor and Niwi{\'n}ski, Damian and Urzyczyn, Pawe{\l}}, BookTitle = {Proc. of FOSSACS'02}, File = {Higher-Order Pushdown Trees Are Easy - Knapik, Niwiński, Urzyczyn (0) (0) - a - a - x.pdf}, Keywords = {higher-order pushdown automata and higher-order recursion schemes}, Pages = {205--222}, Series = {LNCS}, Title = {Higher-Order Pushdown Trees Are Easy}, Volume = {2303}, Year = {2002}, bdsk-url-1 = {http://www.springerlink.com/content/mj6j536kckepbqdw/fulltext.pdf}, bdsk-url-2 = {http://dx.doi.org/10.1007/3-540-45931-6_15}, date-added = {2012-03-06 11:38:24 +0100}, date-modified = {2014-05-19 11:07:16 +0000}, doi = {10.1007/3-540-45931-6_15} }