Squaring transducers: an efficient procedure for deciding functionality and sequentiality
We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.
finite automata functional transducer sequential transducer