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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Boiret, A., Lemay, A., & Niehren, J. (2012). Learning rational functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 273–283). https://doi.org/10.1007/978-3-642-31653-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
