@inproceedings(AehligMO05,
 author       = "Klaus Aehlig and Jolie G. de Miranda and C.-H. Luke Ong",
 year         = "2005",
 title        = "Safety Is not a Restriction at Level 2 for String Languages",
 editor       = "Vladimiro Sassone",
 booktitle    = "FoSSaCS",
 series       = "Lecture Notes in Computer Science",
 volume       = "3441",
 publisher    = "Springer",
 pages        = "490--504",
 url          = "http://dx.doi.org/10.1007/978-3-540-31982-5_31",
)
@article(autebert,
 author       = "J.-M. Autebert and J. Beauquier and L. Boasson.",
 year         = "1980",
 title        = "Langages sur des Alphabets Infinis",
 journal      = "Discrete Applied Mathematics",
 volume       = "2",
 number       = "1",
 pages        = "1--20",
 url          = "http://dx.doi.org/10.1016/0166-218X(80)90050-5",
)
@inproceedings(class_aut,
 author       = "Mikolaj Bojanczyk and Slawomir Lasota",
 year         = "2010",
 title        = "An Extension of Data Automata that Captures XPath",
 booktitle    = "LICS",
 publisher    = "IEEE Computer Society",
 pages        = "243--252",
 url          = "http://doi.ieeecomputersociety.org/10.1109/LICS.2010.33",
)
@inproceedings(data_aut,
 author       = "Mikolaj Bojanczyk and Anca Muscholl and Thomas Schwentick and Luc Segoufin and Claire David",
 year         = "2006",
 title        = "Two-Variable Logic on Words with Data",
 booktitle    = "LICS",
 publisher    = "IEEE Computer Society",
 pages        = "7--16",
 url          = "http://doi.ieeecomputersociety.org/10.1109/LICS.2006.51",
)
@inproceedings(cawo03,
 author       = "Arnaud Carayol and Stefan W{\"o}hrle",
 year         = "2003",
 title        = "The {Caucal} Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata",
 editor       = "Paritosh K. Pandya and Jaikumar Radhakrishnan",
 booktitle    = "FSTTCS",
 series       = "Lecture Notes in Computer Science",
 volume       = "2914",
 publisher    = "Springer",
 pages        = "112--123",
 url          = "http://dx.doi.org/10.1007/978-3-540-24597-1_10",
)
@inproceedings(Caucal02,
 author       = "Didier Caucal",
 year         = "2002",
 title        = "On Infinite Terms Having a Decidable Monadic Theory",
 editor       = "Krzysztof Diks and Wojciech Rytter",
 booktitle    = "MFCS",
 series       = "Lecture Notes in Computer Science",
 volume       = "2420",
 publisher    = "Springer",
 pages        = "165--176",
 url          = "http://dx.doi.org/10.1007/3-540-45687-2_13",
)
@article(ChengK98,
 author       = "Edward Y. C. Cheng and Michael Kaminski",
 year         = "1998",
 title        = "Context-Free Languages over Infinite Alphabets",
 journal      = "Acta Inf.",
 volume       = "35",
 number       = "3",
 pages        = "245--267",
 url          = "http://link.springer.de/link/service/journals/00236/bibs/8035003/80350245.htm",
)
@inproceedings(collapsible,
 author       = "Matthew Hague and Andrzej S. Murawski and C.-H. Luke Ong and Olivier Serre",
 year         = "2008",
 title        = "Collapsible Pushdown Automata and Recursion Schemes",
 booktitle    = "LICS",
 publisher    = "IEEE Computer Society",
 pages        = "452--461",
 url          = "http://doi.ieeecomputersociety.org/10.1109/LICS.2008.34",
)
@inproceedings(Idt84,
 author       = "Jeanne Idt",
 year         = "1984",
 title        = "Automates a Pile sur des Alphabets Infinis",
 editor       = "Max Fontet and Kurt Mehlhorn",
 booktitle    = "STACS",
 series       = "Lecture Notes in Computer Science",
 volume       = "166",
 publisher    = "Springer",
 pages        = "260--273",
 url          = "http://dx.doi.org/10.1007/3-540-12920-0_24",
)
@article(KaminskiF94,
 author       = "Michael Kaminski and Nissim Francez",
 year         = "1994",
 title        = "Finite-Memory Automata",
 journal      = "Theor. Comput. Sci.",
 volume       = "134",
 number       = "2",
 pages        = "329--363",
 url          = "http://dx.doi.org/10.1016/0304-3975(94)90242-9",
)
@inproceedings(easy-trees,
 author       = "Teodor Knapik and Damian Niwinski and Pawel Urzyczyn",
 year         = "2002",
 title        = "Higher-Order Pushdown Trees Are Easy",
 editor       = "Mogens Nielsen and Uffe Engberg",
 booktitle    = "FoSSaCS",
 series       = "Lecture Notes in Computer Science",
 volume       = "2303",
 publisher    = "Springer",
 pages        = "205--222",
 url          = "http://dx.doi.org/10.1007/3-540-45931-6_15",
)
@article(Mas74,
 author       = "A. N. Maslov",
 year         = "1974",
 title        = "The Hierarchy of Indexed Languages of an Arbitrary Level",
 journal      = "Soviet Math. Dokl.",
 volume       = "15",
 pages        = "1170--1174",
)
@article(Mas76,
 author       = "A. N. Maslov",
 year         = "1976",
 title        = "Multilevel Stack Automata",
 journal      = "Problems of Information Transmission",
 volume       = "12",
 pages        = "38--43",
)
@unpublished(parys-panic-new,
 author       = "Pawel Parys",
 year         = "2012",
 title        = "On the Significance of the Collapse Operation",
 note         = "Accepted to LICS",
)
@inproceedings(parys-pumping,
 author       = "Pawel Parys",
 year         = "2012",
 title        = "A Pumping Lemma for Pushdown Graphs of Any Level",
 editor       = "Christoph D{\"u}rr and Thomas Wilke",
 booktitle    = "STACS",
 series       = "LIPIcs",
 volume       = "14",
 publisher    = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
 pages        = "54--65",
 url          = "http://dx.doi.org/10.4230/LIPIcs.STACS.2012.54",
)
@inproceedings(SegoufinData,
 author       = "Luc Segoufin",
 year         = "2006",
 title        = "Automata and Logics for Words and Trees over an Infinite Alphabet",
 editor       = "Zolt{\'a}n {\'E}sik",
 booktitle    = "CSL",
 series       = "Lecture Notes in Computer Science",
 volume       = "4207",
 publisher    = "Springer",
 pages        = "41--57",
 url          = "http://dx.doi.org/10.1007/11874683_3",
)