The VC-dimensions of finite automata with n States

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 744 LNAI, Issue , 1993, Pages 328-341

  Ishigami, Yoshiyasu ^a   Tani, Sei’Ichi ^b  

^a WASEDA UNIVERSITY   (Japan)

^b TOKYO WOMAN'S CHRISTIAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALPHABET SIZE; COMPUTATIONAL LEARNING THEORY; FIXED POSITIVE INTEGERS; VC DIMENSION;

FINITE AUTOMATA;

EID: 84865308333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57370-4_58     Document Type: Conference Paper

References (18)

1. Abe, N.: Learning Commutative Deterministic Finite State Automata in Polynomial Time, New Generation Computing 8, 1991, pp.319-335.
2. Andrews, G.: The Theory of Partitions, Addison-Wesley, Massachusetts (1976).
3. Angluin, D.: Learning regular sets from queries and counterexamples, Information and Computation, Vol. 75, 1987, pp.87-106.
4. Angluin, D.: Queries and concept learning, Machine Learning, Vol. 2, 1988, pp.319-342.
5. Angluin, D.: Negative results for equivalence queries, Machine Learning, Vol. 5, 1990, pp.121-150.
6. Angluin, D. and M. Kharitonov: When Won’t Membership Queries Help? in Proc. of 23nd STOC, ACM, 1991, pp.444-454.
7. Balcazar, J. L., J. Diaz, R. Gavalda and O. Watanabe: A Note on the Query Complexity of Learning DFA, Proc. of the 3rd workshop on Algorithmic Learning Theory, Japanese Society for AI, 1992, pp.53-62.
8. Benedek, G. M. and A. Itai: Nonuniform learnability, International Colloquium on Automata, Languages and Programming 1988, Lecture Notes in Computer Science 317, Springer-Varlag, pp.82-92.
9. Blumer, A., A. Ehrenfeucht, D. Haussler, and M. K. Warmuth: Classifying learnable geometric concepts with Vapnik-Chervonenkis dimension, in Proc. 18th ACM Symp. on Theory of Computing, 1986, pp.273-282.
10. Champarnaud, J.-M. and J.-E. Pin: A Maximin problem on finite automata, Discrete Applied Mathematics 23, 1989, pp.91-96.
11. Hopcroft, J. E., and Ullman, J. D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Massachusetts (1979).
12. Ishigami, Y.: A Sperner set generating a k-dimensional Young tableaux, Preprint (1993).
13. Gaizer, T.: The Vapanik-Chervonenkis dimension of finite automata. Unpublished manuscript (1990).
14. Maass, T., and G. Turán: On the complexity of learning from counterexamples, in Proc. 30th IEEE Symp. on Foundations of Computer Science 1989, pp.262-167.
15. Maass, T., and G. Turán: On the Complexity of Learning from Counterexamples and Membership Queries, in Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp.203-210.
16. Salomaa, A.: Theory of Automata, Pergamon Press, Oxford, 1969.
17. Watanabe, O.: A formal study of learnability via queries, International Colloquium on Automata, Languages and Programming, 1990, Lecture Notes in Computer Science 443, Springer-Varlag.
18. Yokomori, T.: Learning Non-deterministic Finite Automata from Queries and Counterexamples. To appear in Machine Intelligence, Vol.13, Oxford Univ. Press.