Tree Automata and Languages 1992

@book{DBLP:books/el/Nivat92,
  editor    = {Maurice Nivat and
               Andreas Podelski},
  title     = {Tree Automata and Languages},
  publisher = {North-Holland},
  year      = {1992},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Maurice Nivat: Binary tree codes. 1-20
• Philippe Aigrain, Maurice Nivat: Suffix, prefix and maximal tree codes. 21-40
• Andreas Podelski: A monoid approach to tree automata. 41-56
• Magnus Steinby: A theory of tree language varieties. 57-82
• Detlef Seese: Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees. 83-114
• Igor Litovsky, Yves Métivier: Computing trees with graph rewriting systems with priorities. 115-140
• Bruno Courcelle: Recognizable sets of unrooted trees. 141-158
• André Arnold, Damian Niwinski: Fixed point characterization of weak monadic logic definable sets of trees. 159-188
• Ahmed Saoudi, Paola Bonizzoni: Automata on infinite trees and rational control. 189-200
• Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini: Recognizing sets of labelled acyclic graphs. 201-224
• Ahmed Saoudi: Rational and recognizable infinite tree sets. 225-234
• Martin Große-Rhode, Christian Dimitrovici: Algebraic specification of action trees and recursive processes. 235-290
• Irène Guessarian: Trees and algebraic semantics. 291-310
• Jean-Claude Raoult: A survey of tree transductions. 311-326
• Max Dauchet, Sophie Tison: Structural complexity of classes of tree languages. 327-354
• Helmut Seidl: Ambiguity and valuedness. 355-380
• Zoltán Fülöp, Sándor Vágvölgyi: Decidability of the inclusion in monoids generated by tree transformation classes. 381-408
• Aravind K. Joshi, Yves Schabes: Tree-adjoining grammars and lexicalized grammars. 409-432
• I. Simon: A short proof of the factorization forest theorem. 433-438
• Jean H. Gallier: Unification procedures in automated deduction methods based on matings: A survey. 439-