1. Bès, A.: An application of the feferman-vaught theorem to automata and logics for words over an infinite alphabet. Logical Methods in Computer Science 4(1) (2008)
2. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Conference Record of the Eighth Annual Symposium on Switching and Automata Theory, SWAT 1967, pp. 155–160. IEEE (1967)
3. Blumensath, A., Colcombet, T., Löding, C.: Logical theories and compatible operations. In: Flum, J., et al. (eds.) Logic and Automata: History and Perspectives, pp. 73–106. Amsterdam Univ. Press (2008)
4. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Transactions on Computational Logic (TOCL) 12(4), 27 (2011)
5. Czyba, C., Spinrath, C., Thomas, W.: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Full Version). RWTH Aachen University (2015).
https://www.lii.rwth-aachen.de/en/86-finite-automata-over-infinite-alphabets.html