论文信息 - Minimization of Rational Word Functions

Minimization of Rational Word Functions

Rational functions from a free monoid into another are characterized by the finiteness of the index of some congruence naturally associated with the function. A sequential bimachine is constructed computing the function, which is completely canonical, and in some sense minimal. This generalizes the Nerode criterion and the minimal automaton of a rational language, and similar results for sequential functions.

Christophe Reutenauer | Marcel Paul Schützenberger | C. Reutenauer | M. Schützenberger

[1] J. Berstel,et al. Theory of codes , 1985 .

[2] S. Ginsburg. Introduction to Mathematical Machine Theory , 1982 .

[3] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[4] Marcel Paul Schützenberger,et al. A Remark on Finite Transducers , 1961, Inf. Control..

[5] Christian Choffrut,et al. Counting with Rational Functions , 1986, ICALP.

[6] Christian Choffrut,et al. A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings , 1979, ICALP.

[7] Christian Choffrut,et al. Properties of Finite and Pushdown Transducers , 1983, SIAM J. Comput..