Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries

Authors:
Jose Oncina
Affiliations:
Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, Spain
Venue:
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Year:
2008

Citing 6
Cited 0

Learning functions represented as multiplicity automata

Journal of the ACM (JACM)
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Query learning of subsequential transducers

ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
On the applications of multiplicity automata in learning

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Realizations by stochastic finite automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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 ringstructure, 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.