1. Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. RAIRO Informatique Théorique et Applications 30(5), 379–413 (1996)
2. Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Albers, S., Weil, P. (eds.) Proceedings of STACS 2008, pp. 621–632 (2008),
http://stacs-conf.org
(to appear in Theory of Computing Systems)
3. Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. Journal of Computer and System Sciences 2(1), 88–101 (1968)
4. Ibarra, O.: The unsolvability of the equivalence problem for ε-free NGSM’s with unary input (output) alphabet and applications. SIAM Journal on Computing 7(4), 524–532 (1978)
5. Lisovik, L.P.: The identity problem for regular events over the direct product of free and cyclic semigroups (in Ukrainian). Dokl. Akad. Nauk Ukrainskoj RSR ser. A 6, 410–413 (1979)