Klaus Aehlig
Jolie G. de Miranda
C.-H. Luke Ong
2005
Safety Is not a Restriction at Level 2 for String Languages
Vladimiro Sassone
FoSSaCS
Lecture Notes in Computer Science
3441
Springer
490–504
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
1–20
http://dx.doi.org/10.1016/0166-218X(80)90050-5
Mikolaj Bojanczyk
Slawomir Lasota
2010
An Extension of Data Automata that Captures XPath
LICS
IEEE Computer Society
243–252
http://doi.ieeecomputersociety.org/10.1109/LICS.2010.33
Mikolaj Bojanczyk
Anca Muscholl
Thomas Schwentick
Luc Segoufin
Claire David
2006
Two-Variable Logic on Words with Data
LICS
IEEE Computer Society
7–16
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
Paritosh K. Pandya
Jaikumar Radhakrishnan
FSTTCS
Lecture Notes in Computer Science
2914
Springer
112–123
http://dx.doi.org/10.1007/978-3-540-24597-1_10
Didier Caucal
2002
On Infinite Terms Having a Decidable Monadic Theory
Krzysztof Diks
Wojciech Rytter
MFCS
Lecture Notes in Computer Science
2420
Springer
165–176
http://dx.doi.org/10.1007/3-540-45687-2_13
Edward Y. C. Cheng
Michael Kaminski
1998
Context-Free Languages over Infinite Alphabets
Acta Inf.
35
3
245–267
http://link.springer.de/link/service/journals/00236/bibs/8035003/80350245.htm
Matthew Hague
Andrzej S. Murawski
C.-H. Luke Ong
Olivier Serre
2008
Collapsible Pushdown Automata and Recursion Schemes
LICS
IEEE Computer Society
452–461
http://doi.ieeecomputersociety.org/10.1109/LICS.2008.34
Jeanne Idt
1984
Automates a Pile sur des Alphabets Infinis
Max Fontet
Kurt Mehlhorn
STACS
Lecture Notes in Computer Science
166
Springer
260–273
http://dx.doi.org/10.1007/3-540-12920-0_24
Michael Kaminski
Nissim Francez
1994
Finite-Memory Automata
Theor. Comput. Sci.
134
2
329–363
http://dx.doi.org/10.1016/0304-3975(94)90242-9
Teodor Knapik
Damian Niwinski
Pawel Urzyczyn
2002
Higher-Order Pushdown Trees Are Easy
Mogens Nielsen
Uffe Engberg
FoSSaCS
Lecture Notes in Computer Science
2303
Springer
205–222
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
1170–1174
A. N. Maslov
1976
Multilevel Stack Automata
Problems of Information Transmission
12
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
Christoph Dürr
Thomas Wilke
STACS
LIPIcs
14
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
54–65
http://dx.doi.org/10.4230/LIPIcs.STACS.2012.54
Luc Segoufin
2006
Automata and Logics for Words and Trees over an Infinite Alphabet
Zoltán Ésik
CSL
Lecture Notes in Computer Science
4207
Springer
41–57
http://dx.doi.org/10.1007/11874683_3