Algorithmic aspects of decomposition and equivalence of finite-valued transducers

We study algorithmic issues of the problems of decomposing a finite-valued transducer into a union of single-valued ones and inclusion of an arbitrary transducer in a finite-valued one. We propose algorithms that partially improve efficiency estimates for known analogous algorithms.