SCOPUS 정보 검색 플랫폼

Volumn 75, Issue 2, 1987, Pages 87-106

Learning regular sets from queries and counterexamples

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - CONTEXT FREE LANGUAGES; COMPUTER PROGRAMMING - ALGORITHMS;

COUNTEREXAMPLES; LEARNING ALGORITHM; LEARNING REGULAR SETS; MINIMALLY ADEQUATE TEACHER; RANDOM SAMPLING ORACLE;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0023453626 PISSN: 08905401 EISSN: 10902651 Source Type: Journal
DOI: 10.1016/0890-5401(87)90052-6 Document Type: Article

Times cited : (1671)

References (8)

1
- 0003177228
- A note on the number of queries needed to identify regular languages
- (1982) Information and Control , vol.51 , pp. 76-87
- Angluin¹

2
- 0020815483
- Inductive inference: Theory and methods
- (1983) Comput. Surveys , vol.15 , pp. 237-269
- Angluin¹ Smith²

3
- 0004736131
- Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
- Assoc. Comput. Mach, New York
- (1986) Proceedings, Eighteenth Annual ACM Symposium on Theory of Computing , pp. 273-282
- Blumer¹ Ehrenfeucht² Haussler³ Warmuth⁴

4
- 0001187706
- Complexity of automaton identification from given data
- (1978) Inform. Contr. , vol.37 , pp. 302-320
- Gold¹

5
- 0000277085
- System identification via state characterization
- (1972) Automatica , vol.8 , pp. 621-636
- Gold¹

6
- 49549127781
- Complete problems for deterministic polynomial time
- (1977) Theoret. Comput. Sci. , vol.3 , pp. 107-113
- Jones¹ Laaser²

7
- 0003870823
- Algorithmic Program Debugging
- Yale University Computer Science Dept, (1983), published by MIT Press, Cambridge, MA
- (1982) Ph.D. thesis
- Shapiro¹

8
- 0021518106
- A theory of the learnable
- (1984) Comm. ACM , vol.27 , pp. 1134-1142
- Valiant¹

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