1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211. ACM Press, New York (2004)
2. Lecture Notes in Computer Science;R. Alur,2006
3. Lecture Notes in Computer Science;J. Carme,2004
4. Engelfriet, J., Hoogeboom, H.J.: Mso definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Logic 2(2), 216–254 (2001)
5. Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: LICS, p. 188. IEEE Computer Society, Los Alamitos (2003)