Abstract
Rational functions are transformations from words to words that can be defined by string transducers. Rational functions are also captured by deterministic string transducers with lookahead. We show for the first time that the class of rational functions can be learned in the limit with polynomial time and data, when represented by string transducers with lookahead in the diagonal-minimal normal form that we introduce.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)
Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Minimization of automata. Computing Research Repository, abs/1010.5318 (2010)
Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducers. Machine Learning 66(1), 33–67 (2007)
Choffrut, C.: A Generalization of Ginsburg and Rose’s Characterisation of g-s-m Mappings. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 88–103. Springer, Heidelberg (1979)
Choffrut, C.: Minimizing subsequential transducers: a survey. TCS 292(1), 131–143 (2003)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)
de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–137 (1997)
Elgot, C.C., Mezei, G.: On relations defined by generalized finite automata. IBM Journ. of Research and Development 9, 88–101 (1965)
Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10, 198–231 (1977)
Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. JCSS 75(5), 271–286 (2009)
Friese, S., Seidl, H., Maneth, S.: Minimization of Deterministic Bottom-Up Tree Transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 185–196. Springer, Heidelberg (2010)
Gold, E.M.: Complexity of automaton identification from given data. Infor. and Cont. 37, 302–320 (1978)
Högberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. TCS 410(37), 3539–3552 (2009)
Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: TMC, pp. 189–196 (1971)
Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for Top-Down XML transf. In: PODS, pp. 285–296 (2010)
Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Patt. Recog. and Image Anal., pp. 49–61 (1992)
Oncina, J., García, P.: Inference of recognizable tree sets. Tech. report, Univ. de Alicante (1993)
Oncina, J., Garcia, P., Vidal, E.: Learning subsequential transducers for pattern recognition and interpretation tasks. Patt. Anal. & Mach. Intell. 15, 448–458 (1993)
Oncina, J., Varo, M.A.: Using Domain Information during the Learning of a Subsequential Transducer. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 313–325. Springer, Heidelberg (1996)
Reutenauer, C., Schützenberger, M.P.: Minimalization of rational word functions. SIAM Journal on Computing 20, 669–685 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boiret, A., Lemay, A., Niehren, J. (2012). Learning Rational Functions. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)