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]
@article{ChoffrutG09,
title = {Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al},
author = {Christian Choffrut and Serge Grigorieff},
year = {2009},
doi = {10.1016/j.tcs.2008.07.018},
url = {http://dx.doi.org/10.1016/j.tcs.2008.07.018},
researchr = {https://researchr.org/publication/ChoffrutG09},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {1},
pages = {16-34},
}