Klaus Aehlig, Jolie G. de Miranda & C.-H. Luke Ong (2005):
Safety Is not a Restriction at Level 2 for String Languages.
In: Vladimiro Sassone: FoSSaCS,
Lecture Notes in Computer Science 3441.
Springer,
pp. 490–504.
Available at http://dx.doi.org/10.1007/978-3-540-31982-5_31.
J.-M. Autebert, J. Beauquier & L. Boasson. (1980):
Langages sur des Alphabets Infinis.
Discrete Applied Mathematics 2(1),
pp. 1–20.
Available at http://dx.doi.org/10.1016/0166-218X(80)90050-5.
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin & Claire David (2006):
Two-Variable Logic on Words with Data.
In: LICS.
IEEE Computer Society,
pp. 7–16.
Available at http://doi.ieeecomputersociety.org/10.1109/LICS.2006.51.
Arnaud Carayol & Stefan Wöhrle (2003):
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.
In: Paritosh K. Pandya & Jaikumar Radhakrishnan: FSTTCS,
Lecture Notes in Computer Science 2914.
Springer,
pp. 112–123.
Available at http://dx.doi.org/10.1007/978-3-540-24597-1_10.
Didier Caucal (2002):
On Infinite Terms Having a Decidable Monadic Theory.
In: Krzysztof Diks & Wojciech Rytter: MFCS,
Lecture Notes in Computer Science 2420.
Springer,
pp. 165–176.
Available at http://dx.doi.org/10.1007/3-540-45687-2_13.
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong & Olivier Serre (2008):
Collapsible Pushdown Automata and Recursion Schemes.
In: LICS.
IEEE Computer Society,
pp. 452–461.
Available at http://doi.ieeecomputersociety.org/10.1109/LICS.2008.34.
Jeanne Idt (1984):
Automates a Pile sur des Alphabets Infinis.
In: Max Fontet & Kurt Mehlhorn: STACS,
Lecture Notes in Computer Science 166.
Springer,
pp. 260–273.
Available at http://dx.doi.org/10.1007/3-540-12920-0_24.
Teodor Knapik, Damian Niwinski & Pawel Urzyczyn (2002):
Higher-Order Pushdown Trees Are Easy.
In: Mogens Nielsen & Uffe Engberg: FoSSaCS,
Lecture Notes in Computer Science 2303.
Springer,
pp. 205–222.
Available at http://dx.doi.org/10.1007/3-540-45931-6_15.
A. N. Maslov (1974):
The Hierarchy of Indexed Languages of an Arbitrary Level.
Soviet Math. Dokl. 15,
pp. 1170–1174.
A. N. Maslov (1976):
Multilevel Stack Automata.
Problems of Information Transmission 12,
pp. 38–43.
Pawel Parys (2012):
On the Significance of the Collapse Operation.
Accepted to LICS.
Pawel Parys (2012):
A Pumping Lemma for Pushdown Graphs of Any Level.
In: Christoph Dürr & Thomas Wilke: STACS,
LIPIcs 14.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 54–65.
Available at http://dx.doi.org/10.4230/LIPIcs.STACS.2012.54.
Luc Segoufin (2006):
Automata and Logics for Words and Trees over an Infinite Alphabet.
In: Zoltán Ésik: CSL,
Lecture Notes in Computer Science 4207.
Springer,
pp. 41–57.
Available at http://dx.doi.org/10.1007/11874683_3.