Learning behaviors of automata from multiplicity and equivalence queries

SIAM Journal on Computing

Volumn 25, Issue 6, 1996, Pages 1268-1280

  Bergadano, Francesco ^a   Varricchio, Stefano ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Equivalence queries; Exact ientification; Learning from examples; Learning from queries; Membership queries; Multiplicity automata; Multiplicity queries; PAC learning; Probabilistic automata; Unambiguous nondeterministic automata

Indexed keywords

EID: 0012743043     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979326091X     Document Type: Article

References (18)

1. D. ANGLUIN, On the complexity of minimum inference of regular sets, Inform. and Control, 39 (1978), pp. 337-350.
2. _, A note on the number of queries needed to identify regular languages, Inform. and Control, 51 (1981), pp. 76-87.
3. _, Learning regular sets from queries and counterexamples, Inform. and Comput., 75 (1987), pp. 87-106.
4. D. ANGLUIN AND M. KHARITONOV, When won't membership queries help?, in Proc. 23rd Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1991, pp. 444-454.
5. D. ANGLUIN, Negative results for equivalence queries, Mach. Learning, 5 (1990), pp. 121-150.
6. F. BERGADANO AND D. GUNETTI, Inductive Logic Programming: From Machine Learning to Software Engineering, MIT Press, Cambridge, MA, 1996.
7. F. BERGADANO AND S. VARRICCHIO, Learning behaviours of automata from multiplicity and equivalence queries, in Proc. 1994 Italian Conference on Algorithms and Complexity, Lecture Notes in Comput. Sci., 778, Springer-Verlag, Berlin, New York, Heidelberg, 1994, pp. 54-62.
8. J. BERSTEL AND C. REUTENAUER, Rational Series and Their Languages, Springer-Verlag, Berlin, 1988.
9. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
10. M. E. GOLD, Complexity of automaton identification from given data, Inform. and Control, 37 (1978), pp. 302-320.
11. T. HARJU AND J. KARHUMAKI, Decidability of the multiplicity equivalence problem of multitape finite automata, Proc. 22nd Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1990, pp. 477-481.
12. B. K. NATARAJAN, Machine Learning: A Theoretical Approach, Morgan Kaufmann, San Mateo, CA, 1991.
13. A. PAZ, Introduction to Probabilistic Automata, Academic Press, New York, 1991.
14. L. PITT AND M. K. WARMUTH, The minimum consistent DFA problem cannot be approximated within any polynomial, J. Assoc. Comput. Mach., 40 (1993), pp. 95-142.
15. A. SALOMAA AND M. SOITTOLA, Automata Theoretic Aspects of Formal Power Series, Springer-Verlag, New York, 1978.
16. R. E. STEARNS AND H. B. HUNT, On the equivalence and containment problems for unambiguous regular expressions, regular grammars, and finite automata, SIAM J. Comput., 14 (1985), pp. 598-611.
17. W. TZENG, Learning probabilistic automata and markov chains via queries, Mach. Learning, 8 (1992), pp. 151-166.
18. S. VARRICCHIO, On the decidability of the equivalence problem for partially commutative rational power series, Theoret. Comput. Sci., 99 (1992), pp. 291-299.