A. V. Aho
1968
Indexed Grammars - An Extension of Context-Free Grammars
J. ACM
15
4
647–671
10.1145/321479.321488
A. V. Aho
J. D. Ullman
1971
Translations on a Context-Free Grammar
Information and Control
19
5
439–475
10.1016/S0019-9958(71)90706-6
R. Alur
L. D'Antoni
2011
Streaming Tree Transducers
CoRR
abs/1104.2599
R. Alur
P. Madhusudan
2004
Visibly pushdown languages
STOC
202–211
10.1145/1007352.1007390
Y. Andre
F. Bossut
1995
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable
TAPSOFT
155–171
10.1007/3-540-59293-8_193
Y. Andre
F. Bossut
1998
On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers
Theor. Comput. Sci.
205
1-2
207–229
10.1016/S0304-3975(97)00080-7
M. Benedikt
J. Engelfriet
S. Maneth
2013
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
MFCS
146–158
10.1007/978-3-642-40313-2_15
J. Berstel
1979
Transductions and context-free languages
Teubner, Stuttgart
S. Bozapalidis
1992
Alphabetic Tree Relations
Theor. Comput. Sci.
99
2
177–211
10.1016/0304-3975(92)90348-J
M. Caralp
E. Filiot
P.-A. Reynier
F. Servais
J.-M. Talbot
2013
Expressiveness of Visibly Pushdown Transducers
TTATT
17–26
10.4204/EPTCS.134.3
H. Comon
M. Dauchet
R. Gilleron
F. Jacquemard
C. Löding
D. Lugiez
S. Tison
M. Tommasi
2007
Tree Automata Techniques and Applications
Available at: http://www.grappa.univ-lille3.fr/tata
B. Courcelle
J. Engelfriet
2012
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach
Encyclopedia of mathematics and its applications
138
Cambridge University Press
10.1017/CBO9780511977619
B. Courcelle
P. Franchi-Zannettacci
1982
Attribute Grammars and Recursive Program Schemes I
Theor. Comput. Sci.
17
163–191
10.1016/0304-3975(82)90003-2
B. Courcelle
P. Franchi-Zannettacci
1982
Attribute Grammars and Recursive Program Schemes II
Theor. Comput. Sci.
17
235–257
10.1016/0304-3975(82)90024-X
B. Courcelle
P. Franchi-Zannettacci
1982
On the Equivalence Problem for Attribute Systems
Information and Control
52
3
275–305
10.1016/S0019-9958(82)90786-0
K. Culik II
1976
On the Decidability of the Sequence Equivalence Problem for D0L-Systems
Theor. Comput. Sci.
3
1
75–84
10.1016/0304-3975(76)90066-9
K. Culik II
I. Fris
1977
The Decidability of the Equivalence Problem for D0L-Systems
Information and Control
35
1
20–39
10.1016/S0019-9958(77)90512-5
K. Culik II
J. Karhumäki
1986
A new proof for the D0L Sequence Equivalence Problem and its implications
10.1007/978-3-642-95486-3_5
G. Rozenberg
A. Salomaa
The book of L
Springer, Berlin
63–74
J. Engelfriet
1977
Top-down Tree Transducers with Regular Look-ahead
Mathematical Systems Theory
10
289–303
10.1007/BF01683280
J. Engelfriet
1980
Some open questions and recent results on tree transducers and tree languages
R. V. Book
Formal Language Theory; Perspectives and Open Problems
Academic Press, New York
J. Engelfriet
S. Maneth
1999
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
Inf. Comput.
154
1
34–91
10.1137/S0097539701394511
J. Engelfriet
S. Maneth
2002
Output String Languages of Compositions of Deterministic Macro Tree Transducers
J. Comput. Syst. Sci.
64
2
350–395
10.1006/jcss.2001.1816
J. Engelfriet
S. Maneth
2003
A comparison of pebble tree transducers with macro tree transducers
Acta Inf.
39
9
613–698
10.1007/s00236-003-0120-0
J. Engelfriet
S. Maneth
2003
Macro Tree Translations of Linear Size Increase are MSO Definable
SIAM J. Comput.
32
4
950–1006
10.1137/S0097539701394511
J. Engelfriet
S. Maneth
2006
The equivalence problem for deterministic MSO tree transducers is decidable
Inf. Process. Lett.
100
5
206–212
10.1016/j.ipl.2006.05.015
J. Engelfriet
S. Maneth
H. Seidl
2009
Deciding equivalence of top-down XML transformations in polynomial time
J. Comput. Syst. Sci.
75
5
271–286
10.1016/j.jcss.2009.01.001
J. Engelfriet
S. Maneth
H. Seidl
2013
Look-Ahead Removal for Top-Down Tree Transducers
CoRR
abs/1311.2400
J. Engelfriet
G. Rozenberg
G. Slutzki
1980
Tree Transducers, L Systems, and Two-Way Machines
J. Comput. Syst. Sci.
20
2
150–202
10.1016/0022-0000(80)90058-6
J. Engelfriet
H. Vogler
1985
Macro Tree Transducers
J. Comput. Syst. Sci.
31
1
71–146
10.1016/0022-0000(85)90066-2
Z. Ésik
1981
Decidability results concerning tree transducers I
Acta Cybern.
5
1
1–20
J. Esparza
1997
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
Fundam. Inform.
31
1
13–25
10.3233/FI-1997-3112
E. Filiot
J.-F. Raskin
P.-A. Reynier
F. Servais
J.-M. Talbot
2010
Properties of Visibly Pushdown Transducers
MFCS
355–367
10.1007/978-3-642-15155-2_32
E. Filiot
F. Servais
2012
Visibly Pushdown Transducers with Look-Ahead
SOFSEM
251–263
10.1007/978-3-642-27660-6_21
M. J. Fischer
1968
Grammars with Marcro-like Productions
Harvard University
S. Friese
2011
On Normalization and Type Checking for Tree Transducers
Institut für Informatik
Technische Universität München
Available at http://mediatum.ub.tum.de/doc/1078090/1078090.pdf
S. Friese
H. Seidl
S. Maneth
2011
Earliest Normal Form and Minimization for Bottom-up Tree Transducers
Int. J. Found. Comput. Sci.
22
7
1607–1623
10.1142/S012905411100891X
Z. Fülöp
H. Vogler
1998
Syntax-Directed Semantics - Formal Models Based on Tree Transducers
Monographs in Theoretical Computer Science. An EATCS Series
Springer
10.1007/978-3-642-72248-6
S. Ginsburg
1966
The Mathematical Theory of Context-Free Languages
McGraw-Hill
S. Ginsburg
E. H. Spanier
1964
Bounded ALGOL-like languages
Trans. Amer. Math. Soc
113
333–368
10.2307/1994067
T. V. Griffiths
1968
The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines
J. ACM
15
3
409–413
10.1145/321466.321473
E. M. Gurari
1982
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
SIAM J. Comput.
11
3
448–452
10.1137/0211035
S. Hakuta
S. Maneth
K. Nakano
H. Iwasaki
2014
XQuery Streaming by Forest Transducers
ICDE
417–428
J. Honkala
2000
A short solution for the HDT0L sequence equivalence problem
Theor. Comput. Sci.
244
1-2
267–270
10.1016/S0304-3975(00)00158-4
J. E. Hopcroft
J. D. Ullman
1979
Introduction to Automata Theory, Languages and Computation
Addison-Wesley
J. Karhumäki
W. Plandowski
W. Rytter
1995
Polynomial Size Test Sets for Context-Free Languages
J. Comput. Syst. Sci.
50
1
11–19
10.1006/jcss.1995.1002
D. E. Knuth
1968
Semantics of Context-Free Languages
Mathematical Systems Theory
2
2
127–145
10.1007/BF01692511
A. Lemay
S. Maneth
J. Niehren
2010
A learning algorithm for top-down XML transformations
PODS
285–296
10.1145/1807085.1807122
S. Maneth
2003
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase
FSTTCS
326–337
10.1007/978-3-540-24597-1_28
S. Maneth
A. Berlea
T. Perst
H. Seidl
2005
XML type checking with macro tree transducers
PODS
283–294
10.1145/1065167.1065203
S. Maneth
T. Perst
H. Seidl
2007
Exact XML Type Checking in Polynomial Time
ICDT
254–268
10.1007/11965893_18
T. Milo
D. Suciu
V. Vianu
2003
Typechecking for XML transformers
J. Comput. Syst. Sci.
66
1
66–97
10.1016/S0022-0000(02)00030-2
K. Nakano
S.-C. Mu
2006
A Pushdown Machine for Recursive XML Processing
APLAS
340–356
10.1007/11924661_21
R. Parikh
1966
On Context-Free Languages
J. ACM
13
4
570–581
10.1145/321356.321364
T. Perst
H. Seidl
2004
Macro forest transducers
Inf. Process. Lett.
89
3
141–149
10.1016/j.ipl.2003.05.001
W. Plandowski
1994
Testing Equivalence of Morphisms on Context-Free Languages
ESA
460–470
J.-F. Raskin
F. Servais
2008
Visibly Pushdown Transducers
ICALP (2)
386–397
10.1007/978-3-540-70583-3_32
W. C. Rounds
1969
Context-Free Grammars on Trees
STOC
143–148
10.1145/800169.805428
W. C. Rounds
1970
Mappings and Grammars on Trees
Mathematical Systems Theory
4
3
257–287
10.1007/BF01695769
K. Ruohonen
1986
Equivalence problems for regular sets of word morphisms
10.1007/978-3-642-95486-3_33
G. Rozenberg
A. Salomaa
The book of L
Springer, Berlin
393–401
H. Seidl
1992
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time
Theor. Comput. Sci.
106
1
135–181
10.1016/0304-3975(92)90281-J
H. Seidl
1994
Equivalence of Finite-Valued Tree Transducers Is Decidable
Mathematical Systems Theory
27
4
285–346
10.1007/BF01192143
H. Seidl
1994
Haskell Overloading is DEXPTIME-Complete
Inf. Process. Lett.
52
2
57–60
10.1016/0020-0190(94)00130-8
H. Seidl
2014
Private Communication
H. Seidl
T. Schwentick
A. Muscholl
P. Habermehl
2004
Counting in Trees for Free
ICALP
1136–1149
10.1007/978-3-540-27836-8_94
F. Servais
2011
Visibly Pushdown Transducers
Université Libre de Bruxelles
S. Staworko
G. Laurence
A. Lemay
J. Niehren
2009
Equivalence of Deterministic Nested Word to Word Transducers
FCT
310–322
10.1007/978-3-642-03409-1_28
J. W. Thatcher
1970
Generalized Sequential Machine Maps
J. Comput. Syst. Sci.
4
4
339–367
10.1016/S0022-0000(70)80017-4
H. Vogler
1991
Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Case Study of Tree Transducers
Sci. Comput. Program.
16
3
251–275
10.1016/0167-6423(91)90009-M
J. Voigtländer
2005
Tree transducer composition as program transformation
Technical University Dresden
Z. Zachar
1979
The solvability of the equivalence problem for deterministic frontier-to-root tree transducers
Acta Cybern.
4
2
167–177