Advertisement

Over Which Monoids is the Transducer Determinization Procedure Applicable?

  • Stefan Gerdjikov
  • Stoyan MihovEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10168)

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.

Keywords

Transducers Rational functions Twinning property 

References

  1. 1.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)zbMATHGoogle Scholar
  5. 5.
    Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Comput. Sci. 356(1–2), 224–244 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1–20 (1996)CrossRefGoogle Scholar
  7. 7.
    Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269–311 (1997)MathSciNetGoogle Scholar
  8. 8.
    Roche, E., Schabes, Y.: Introduction. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 1–66. MIT Press, Cambridge (1997)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Faculty of Mathematics and InformaticsSofia UniversitySofiaBulgaria
  2. 2.Institute of Information and Communication TechnologiesBulgarian Academy of SciencesSofiaBulgaria

Personalised recommendations