1. B. S. Baker, Tree transductions and families of tree languages,Ph.D.Thesis, Harvard University, 1973, andProc. 5th Ann. ACM Symp. on Theory of Computing (1973), 200–206.
2. J. Doner, Tree acceptors and some of their applications,J. Comp. Syst. Sci. 4 (1970), 406–451.
3. S. Ginsburg,The mathematical theory of context-free languages, McGraw-Hill Book Co., New York, 1966.
4. J. E. Hopcroft andJ. D. Ullman,Formal languages and their relation to automata, Addison-Wesley Publ. Co., Reading, Mass., 1969.
5. M. Magidor andG. Moran, Finite automata over finite trees, Hebrew University,Technical Report No. 30, 1969.