Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
SIGACT News complexity theory column 32
ACM SIGACT News
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning expressions and programs over monoids
Information and Computation
Learning expressions and programs over monoids
Information and Computation
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On optimal learning algorithms for multiplicity automata
COLT'06 Proceedings of the 19th annual conference on Learning Theory
| Hi-index | 0.00 |
We consider the problem of identifying the behavior of an unknown automaton with multiplicity in the field $\Ratviii$ of rational numbers ($\Ratviii$-automaton) from multiplicity and equivalence queries. We provide an algorithm which is polynomial in the size of the $\Ratviii$-automaton and in the maximum length of the given counterexamples. As a consequence, we have that $\Ratviii$-automata are probably approximately correctly learnable (PAC-learnable) in polynomial time when multiplicity queries are allowed. A corollary of this result is that regular languages are polynomially predictable using membership queries with respect to the representation of unambiguous nondeterministic automata. This is important since there are unambiguous automata such that the equivalent deterministic automaton has an exponentially larger number of states.