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]

Authors

Christian Choffrut

This author has not been identified. Look up 'Christian Choffrut' in Google

Serge Grigorieff

This author has not been identified. Look up 'Serge Grigorieff' in Google