1. Aleshin, M.: Finite automata and Burnside’s problem for periodic groups. Mat. Notes 11, 199–203 (1972)
2. Bárány, V.: A Hierarchy of Automatic Words having a Decidable MSO Theory. In: Caucal, D. (ed.) Online Proceedings of the 11th Journées Montoises, Rennes (2006)
3. Béal, M., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1), 45–63 (2003)
4. Blumensath, A.: Automatic Structures. Diploma Thesis, RWTH Aachen (1999)
5. Blumensath, A., Grädel, E.: Automatic Structures. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, pp. 51–62 (2000)