Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al

Christian Choffrut, Serge Grigorieff. Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. Theoretical Computer Science, 410(1):16-34, 2009. [doi]

Bibliographies