Learning deterministic finite automata from smallest counterexamples

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 4, 2000, Pages 465-491

  Birkendorf, Andreas ^a   Böker, Andreas ^b   Simon, Hans Ulrich ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Deterministic finite automata; Learning from smallest counterexamples; Multiplicity automata; Self directed learning

Indexed keywords

EID: 2242464110     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198340943     Document Type: Article

References (22)

1. S. B. AKERS, Binary decision diagrams, IEEE Trans. Comput., 27 (1978), pp. 509-516.
2. D. ANGLUIN, Learning regular sets from queries and counterexamples, Inform. and Comput., 75 (1987), pp. 87-106.
3. D. ANGLUIN, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
4. D. ANGLUIN, Negative results for equivalence queries, Machine Learning, 5 (1990), pp. 121-150.
5. A. BEIMEL, F. BERGADANO, N. H. BSHOUTY, E. KUSHILEVITZ, AND S. VARRICCHIO, On the applications of multiplicity automata in learning, in Proceedings of the 37th IEEE Annual Symposium on the Foundations of Computer Science, Burlington, VT, 1996, pp. 349-358.
6. F. BERGADANO AND S. VARRICCHIO, Learning behaviours of automata from shortest counterexamples, in Proceedings of the 2nd European Conference on Computational Learning Theory, Springer-Verlag, Berlin, 1995, pp. 380-391.
7. F. BERGADANO AND S. VARRICCHIO, Learning behaviors of automata from multiplicity and equivalence queries, SIAM J. Comput., 25 (1996), pp. 1268-1280.
8. J. BERSTEL AND C. REUTENAUER, Rational Series and Their Languages, Monogr. Theoret. Comput. Sci. EATCS Ser. 12, Springer-Verlag, Berlin, 1988.
9. A. BIRKENDORF, A. BÖKER, AND H. U. SIMON, Learning deterministic finite automata from smallest counterexamples, in Proceedings of the 9th International ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 599-609.
10. A. BIRKENDORF AND H. U. SIMON, Using computational learning strategies as a tool for combinatorial optimization, Ann. Math. Artificial Intelligence, 22 (1998), pp. 237-257.
11. R. E. BRYANT, Symbolic boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, 24 (1992), pp. 293-318.
12. J. W. CARLYLE AND A. PAZ, Realization by stochastic finite automaton, J. Comput. System Sci., 5 (1971), pp. 26-40.
13. M. FLIESS, Matrices de hankel, J. Math. Pures Appl. (9), 53 (1974), pp. 197-222. Erratum in vol. 54.
14. S. A. GOLDMAN AND R. H. SLOAN, The power of self-directed learning, Machine Learning, 14 (1994), pp. 271-294.
15. J. E. HOPCROFT AND J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison Wesley, Reading, MA, 1969.
16. O. H. IBARRA AND T. JIANG, Learning regular languages from counterexamples, J. Comput. System Sci., 43 (1991), pp. 299-316.
17. Y. ISHIGAMI AND S. TANI, VC-dimensions of finite automata and commutative finite automata with k letters and n states, Discrete Appl. Math., 74 (1997), pp. 123-134.
18. J. FORSTER, Learning multiplicity automata from smallest counterexamples, in Proceedings of the 4th European Conference on Computational Learning Theory, Springer-Verlag, Berlin, 1999, pp. 79-90.
19. C. Y. LEE, Representation of switching circuits by binary-decision programs, Bell Systems Technical Journal, 38 (1959), pp. 985-999.
20. H. OHNISHI, H. SEKI, AND T. KASAMI, A polynomial time learning algorithm for recognizable series, IEICE Transactions on Informations and Systems, E77-D(10) (1994), pp. 1077-1085.
21. R. L. RIVEST AND R. E. SCHAPIRE, Inference of finite automata using homing sequences, Inform. and Comput., 103 (1993), pp. 299-347.
22. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1971), pp. 264-280.