1. M. Benedikt, L. Libkin, Tree extension algebras: Logics, automata, and query languages, in: Proc. 17th LICS, 2002, pp. 203–212
2. Logical reversibility of computation;Bennett;IBM J. Res. Develop.,1973
3. Program termination and well partial orderings;Blaas;ACM Trans. Comput. Logic,2006
4. A. Blumensath, Automatic structures, Diploma Thesis, RWTH Aachen, 1999
5. Blumensath, E. Grädel, Automatic structures, in: Proc. 15th LICS, 2000, pp. 51–62