Abstract
Multiplicity Automata are devices that implement functions from a string space to a field. Usually the real number’s field is used. From a learning point of view there exists some algorithms that are able to identify any multiplicity automaton from membership and equivalence queries.
In this work we realize that those algorithms can also be used if the algebraic structure of a field is relaxed to a divisive ring structure, that is, the commutativity of the product operation is dropped.
Moreover, we define an algebraic structure, which is an extension of the string monoid, that allows the identification of any transduction that can be realized by finite state machines without empty-transitions.
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
Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: On the applications of multiplicity automata in learning. In: IEEE Symposium on Foundations of Computer Science, pp. 349–358 (1996)
Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506–530 (2000)
Carlyle, J.W., Paz, A.: Realizations by stochastic finite automaton. J. Comput. Syst. Sci. 5, 26–40 (1971)
Fliess, M.: Matrices de hankel. J. Math. Pures Appl. 53, 197–222 (1974) (Erratum in vol. 54, 1975)
Vilar, J.M.: Query learning of subsequential transducers. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 72–83. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oncina, J. (2008). Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)