Deterministic tree pushdown automata and monadic tree rewriting systems

Aho, 1968, Indexed grammars-An extension of context-free grammars, J. Assoc. Comput. Mach., 15, 647, 10.1145/321479.321488 Arnold, 1976, Une théorème de duplication pour les forêts algebriques, J. Comput. System Sci., 13, 223, 10.1016/S0022-0000(76)80032-3 Arnold, 1978, Forêts algebriques et homomorphismes inverses, Inform. and Control, 37, 182, 10.1016/S0019-9958(78)90510-7 Berstel, 1976, Congruences plus que parfaites et langages algebriques, 123 Book, 1982, Confluent and other types of Thue systems, J. Assoc. Comput. Mach., 29, 171, 10.1145/322290.322301 Book, 1987, Thue systems as rewriting systems, J. Symbolic Comput., 3, 39, 10.1016/S0747-7171(87)80021-4 Book, 1982, Monadic Thue systems, Theoret. Comput. Sci., 19, 231, 10.1016/0304-3975(82)90036-6 Engelfriet, 1977, IO and OI Parts 1, 2, J. Comput. System Sci., 15, 328, 10.1016/S0022-0000(77)80034-2 Engelfriet, 1978, IO and OI Parts 1, 2, J. Comput. System Sci., 16, 67, 10.1016/0022-0000(78)90051-X Gallier, 1985, Reductions in tree replacement systems, Theoret. Comput. Sci., 37, 123, 10.1016/0304-3975(85)90089-1 Gěcseg, 1984 Guessarian, 1983, Pushdown tree automata, Math. Systems Theory, 16, 237, 10.1007/BF01744582 Huet, 1980, Confluent reductions: Abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach., 27, 797, 10.1145/322217.322230 Huet, 1980, Equations and rewrite rules, 349 Rosen, 1971, Subtree Replacement Systems Rosen, 1973, Tree-manipulating systems and Church-Rosser theorems, J. Assoc. Comput. Mach., 20, 160, 10.1145/321738.321750 Rounds, 1970, Mappings and grammars on trees, Math. Systems Theory, 4, 257, 10.1007/BF01695769 Schimpf, 1982, A Parsing Method for Context-free Tree Languages Schimpf, 1985, Tree pushdown automata, J. Comput. System Sci., 30, 25, 10.1016/0022-0000(85)90002-9