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

메뉴 건너뛰기

Machine Learning

Volumn 7, Issue 2, 1991, Pages 109-138

Learning Automata from Ordered Examples

(2) Porat, Sara a Feldman, Jerome A b

a IBM (Israel)

b INTERNATIONAL COMPUTER SCIENCE INSTITUTE (United States)

Author keywords

connectionist; finite automata; Learning

Indexed keywords

EID: 0002645349 PISSN: 08856125 EISSN: 15730565 Source Type: Journal
DOI: 10.1023/A:1022642911489 Document Type: Article

Times cited : (35)

References (30)

1
- 0023453626
- Learning regular sets from queries and counterexamples
- (1987) Information and Computation , vol.75 , pp. 87-106
- Angluin, D.¹

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

3
- 0018062404
- On the complexity of minimum inference of regular sets
- (1978) Information and Control , vol.39 , pp. 337-350
- Angluin, D.¹

4
- 78149249322
- Department of Electrical Engineering & Computer Science, Univ., California, Berkeley
- (1976) An application of the theory of computational complexity to the study of inductive inference
- Angluin, D.¹

5
- 0020815483
- Inductive inference:Theory and methods
- (1983) Computing Surveys , vol.15 , pp. 237-269
- Angluin, D.¹ Smith, C.H.²

6
- 84938806379
- On the synthesis of finite-state machines from samples of their behavior
- (1978) IEEE Trans, on Computers , vol.100-121 , pp. 592-597
- Biermann, A.W.¹ Feldman, J.A.²

7
- 0642330822
- Intelligence without representation
- MIT, Cambridge, MA
- (1987) Proceedings of the Conf.on foundations of AI
- Brooks, R.A.¹

8
- 49049129797
- Connectionist models and their properties
- (1982) Cognitive Science , vol.6 , pp. 205-254
- Feldman, J.A.¹ Ballard, D.H.²

9
- 0001187706
- Complexity of automaton identification from given data
- (1978) Information and Control , vol.37 , pp. 302-320
- Gold, E.M.¹

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

11
- 49949150022
- Language identification in the limit
- (1967) Information and Control , vol.10 , pp. 447-474
- Gold, E.M.¹

12
- 0004141541
- Pittsburgh, PA, Carnegie Mellon University, Computer Science Department
- (1987) Connectionist learning procedures
- Hinton, G.E.¹

13
- 0003620778
- Reading, MA, Addison-Wesley
- (1979) Introduction to automata and formal languages
- Hopcroft, J.E.¹ Ullman, J.D.²

14
- 84951519335
- Horning, J.K.(1969). A study of grammatical inference.Ph.D.thesis, Stanford University.

15
- 84955580713
- Learning regular languages from counterexamples
- MA, Boston
- (1988) Proceedings of the 1988 Workshop on Computational Learning Theory , pp. 371-385
- Ibarra, O.H.¹ Jiang, T.²

16
- 0001509105
- Combining postulates of naturalness in inductive inference
- (1981) Journal of Infor-mation Processing and Cybernetics , vol.17 , pp. 465-484
- Jantke, K.P.¹ Beick, H-R.²

17
- 84951519336
- Kearns, M., Li, J., Pitt, L., & Valiant, L.(1987). On the learnability of boolean formulae. Proceedings of the 9th Annual ACM Symp.on Theory of Computing (pp. 284-295), New York, NY.

18
- 84951519337
- Natarajan, B.K.(1987). On learning boolean functions. Proceedings of the 9th Annual ACM Symp.on Theory of Computing (pp. 296-394).New York, NY.

19
- 0003673520
- MIT Press, Cambridge, MA
- (1986) Systems that learn:An introduction to learning theory for conginitive and computer scientists
- Osherson, D.N.¹ Stob, M.² Weinstein, S.³

20
- 85025854222
- Rivest, R.L., & Schapire, R.E.(1987). A new approach to unsupervised learning in deterministic environments. Proceedings of the 4th International Workshop on Machine Learning.Irvine, CA.

21
- 84951519339
- Rivest, R.L., & Schapire, R.E.(1987). Diversity-based inference of finite automata. Proceedings of the 28th Annual Symp.on Foundations of Computer Science.Los Angeles, CA.

22
- 0003444646
- D.E., Rumelhart, J.L., McClelland, Bradford Books/MIT Press, Cambridge, MA
- (1986) Parallel distributed processing, explorations in the microstructure of cognition
- Rumelhart, D.¹

23
- 84951519340
- M.Sc.Thesis in Computer Science, Technion, Haifa, Israel
- (1990) Learning automata
- Sharon, M.¹

24
- 84951519341
- Trakhtenbrot, B.A., & Barzdin, Ya.M.(1973). Finite automata.Amsterdam:North-Holland.

25
- 85025859546
- Valiant, L.G.(1985). Learning disjunctions of conjunctions. Proceedings of the 9th IJCAI (pp. 560-566).Los Angeles, CA.

26
- 0021518106
- A theory of the learnable
- (1984) CACM , vol.27 , pp. 1134-1142
- Valiant, L.G.¹

27
- 85025868444
- Waltz, D., & Feldman, J.A.(Eds.).(1987). Connectionist models and their implications.Ablex Publishing Corp.

28
- 84951517859
- M.Sc.thesis in Electrical Engi-neering, Technion, Haifa, Israel
- (1990) Iterative learning finite automata-Application by neural net
- Weisberg, Y.¹

29
- 0002124086
- Limeserkennung rekursiver funktionen durch spezielle strategien
- (1976) Elektronische Informa-tionsverarbeitung und Kybernetik , vol.12 , pp. 93-99
- Wiehagen, R.¹

30
- 84951519344
- Williams, R.J.(1987). Reinforcement-learning connectionst systems (TR NU-CCS-87-3). 34

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