Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
It can be easily shown that \(d_\mathcal {M}\) is a distance.
- 2.
This assumption is not a significant limitation since if it is not the case we can modify the state output function to output the desired word \(\alpha \) for the starting state on the resulting subsequential transducer.
- 3.
That is we ignore the output produced by \(\mathcal {M}_{j}\) for \(j\ne i\).
References
Béal, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoret. Comput. Sci. 292(1), 45–63 (2003)
Choffrut, C.: Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationelles. Theoret. Comput. Sci. 5, 325–338 (1977)
Daviaud, L., Reynier, P.A., Talbot, J.M.: A generalised twinning property for minimisation of cost register automata. In: Proceedings - Symposium on Logic in Computer Science, pp. 857–866 (2016)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)
Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Comput. Sci. 356(1–2), 224–244 (2006)
Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1–20 (1996)
Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269–311 (1997)
Roche, E., Schabes, Y.: Introduction. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 1–66. MIT Press, Cambridge (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Gerdjikov, S., Mihov, S. (2017). Over Which Monoids is the Transducer Determinization Procedure Applicable?. In: Drewes, F., MartÃn-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2017. Lecture Notes in Computer Science(), vol 10168. Springer, Cham. https://doi.org/10.1007/978-3-319-53733-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-53733-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53732-0
Online ISBN: 978-3-319-53733-7
eBook Packages: Computer ScienceComputer Science (R0)