Learning Behaviors of Automata from Multiplicity and Equivalence Queries

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.

[1]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[2]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[3]  Lorenza Saitta,et al.  Machine learning - an integrated framework and its applications , 1991, Ellis Horwood series in artificial intelligence.

[4]  Harry B. Hunt,et al.  On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata , 1985, SIAM J. Comput..

[5]  Tero Harju,et al.  Decidability of the multiplicity equivalence of multitape finite automata , 1990, STOC '90.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[8]  Francesco Bergadano,et al.  An Interactive System to Learn Functional Logic Programs , 1993, IJCAI.

[9]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[10]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[11]  Leonard Pitt,et al.  The minimum consistent DFA problem cannot be approximated within any polynomial , 1993, JACM.

[12]  Stefano Varricchio.  On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series , 1992, Theor. Comput. Sci..

[13]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.