Over Which Monoids is the Transducer Determinization Procedure Applicable?

The input determinization of a finite-state transducer for constructing an equivalent subsequential transducer is performed by the well-known inductive transducer determinization procedure. This procedure has been shown to complete for rational functions with the bounded variation property. The result has been obtained for functions \(f : \varSigma ^*\rightarrow \mathcal {M}\), where \(\mathcal {M}\) is a free monoid, the monoid of non-negative real numbers with addition or a Cartesian product of those monoids. In this paper we generalize this result and define and prove sufficient conditions for a monoid \(\mathcal {M}\) and a rational function \(f : \varSigma ^*\rightarrow \mathcal {M}\), under which the transducer determinization procedure is applicable and terminates.