The 1-ary transductions are exactly the sets recognizable by finite automata. However, for n > 1 the relations recognizable by automata constitute a proper subclass of the n-ary transductions. The ...