1. Translations on a context-free grammar;Aho;Inform. and Control,1971
2. Automata on a 2-dimensional tape;Blum,1967
3. M. Bojańczyk, 1-bounded TWA cannot be determinized, in: 23rd Conf. Foundations of Software Technology and Theoretical Computer Science, FSTTCS’03, Lecture Notes in Computer Science, Vol. 2914, Springer, Berlin, 2003, pp. 62, 73.
4. Tree-walking pebble automata;Engelfriet,1999
5. Trips on trees;Engelfriet;Acta Cybernetica,1999