SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 74, Issue 2, 1997, Pages 123-134

VC-dimensions of finite automata and commutative finite automata with k letters and n states

(2) Ishigami, Yoshiyasu a Tani, Sei'ichi b

a UNIVERSITY OF ELECTRO COMMUNICATIONS (Japan)

b TOKAI UNIVERSITY (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041633409 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(96)00025-X Document Type: Article

Times cited : (13)

References (14)

1
- 0040649264
- Learning commutative deterministic finite state automata in polynomial time
- N. Abe, Learning commutative deterministic finite state automata in polynomial time. New Generation Computing 8 (1991) 319-335.
- (1991) New Generation Computing , vol.8 , pp. 319-335
- Abe, N.¹

2
- 0004100864
- Addison-Wesley. Reading, Massachusetts
- G. Andrews, The Theory of Partitions (Addison-Wesley. Reading, Massachusetts, 1976).
- (1976) The Theory of Partitions
- Andrews, G.¹

3
- 0023453626
- Learning regular sets from queries and counterexamples
- D. Angluin, Learning regular sets from queries and counterexamples, Inform. and Comput. 75 (1987) 87-106.
- (1987) Inform. and Comput. , vol.75 , pp. 87-106
- Angluin, D.¹

4
- 0000710299
- Queries and concept learning
- D. Angluin, Queries and concept learning, Machine Learning 2 (1988) 319-342.
- (1988) Machine Learning , vol.2 , pp. 319-342
- Angluin, D.¹

5
- 0025449393
- Negative results for equivalence queries
- D. Angluin, Negative results for equivalence queries, Machine Learning 5 (1990) 121-150.
- (1990) Machine Learning , vol.5 , pp. 121-150
- Angluin, D.¹

6
- 0040649266
- Nonuniform learnability
- Internat. Coll. on Automata, Languages and Programming 1988, Springer, Berlin
- G.M. Benedek and A. Itai, Nonuniform learnability, in: Internat. Coll. on Automata, Languages and Programming 1988, Lecture Notes in Computer Science, Vol. 317 (Springer, Berlin) 82-92.
- Lecture Notes in Computer Science , vol.317 , pp. 82-92
- Benedek, G.M.¹ Itai, A.²

7
- 0024750852
- Learnability and the Vapnik-Chervonenkis dimension
- A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM 36 (1989) 929-965.
- (1989) J. ACM , vol.36 , pp. 929-965
- Blumer, A.¹ Ehrenfeucht, A.² Haussler, D.³ Warmuth, M.⁴

8
- 38249022542
- A maximin problem on finite automata
- J.-M. Champarnaud and J.-E. Pin, A maximin problem on finite automata, Discrete Appl. Math. 23 (1989) 91-96.
- (1989) Discrete Appl. Math. , vol.23 , pp. 91-96
- Champarnaud, J.-M.¹ Pin, J.-E.²

9
- 0003620778
- Addison-Wesley, Reading, Massachusetts
- J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, Massachusetts 1979).
- (1979) Introduction to Automata Theory, Languages, and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

10
- 0024768667
- On the complexity of learning from counterexamples
- W. Maass and G. Turán, On the complexity of learning from counterexamples, in: Proc. 30th IEEE Symp. on Foundations of Computer Science (1989) 262-267.
- (1989) Proc. 30th IEEE Symp. on Foundations of Computer Science , pp. 262-267
- Maass, W.¹ Turán, G.²

11
- 0025840733
- On the complexity of learning from counterexamples and membership queries
- W. Maass 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) 203-210.
- (1990) Proc. 31st IEEE Symp. on Foundations of Computer Science , pp. 203-210
- Maass, W.¹ Turán, G.²

12
- 0000586256
- Lower bound methods and separation results for on-line learning models
- W. Maass and G. Turán, Lower bound methods and separation results for on-line learning models, Machine Learning 9 (1992) 107-145.
- (1992) Machine Learning , vol.9 , pp. 107-145
- Maass, W.¹ Turán, G.²

13
- 0004267265
- Pergamon Press, Oxford
- A. Salomaa, Theory of Automata (Pergamon Press, Oxford, 1969).
- (1969) Theory of Automata
- Salomaa, A.¹

14
- 0001024505
- On the uniform convergence of relative frequencies
- V.N. Vapnik and A.Y. Chervonenkis, On the uniform convergence of relative frequencies, Theory Probab. Appl. 16 (1971) 264-280.
- (1971) Theory Probab. Appl. , vol.16 , pp. 264-280
- Vapnik, V.N.¹ Chervonenkis, A.Y.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.