SCOPUS 정보 검색 플랫폼

Journal of Computer and System Sciences

Volumn 63, Issue 3, 2001, Pages 305-354

Language learning from texts: Degrees of intrinsic complexity and their characterizations

(3) Jain, Sanjay a Kinber, Efim b Wiehagen, Rolf c

a NATIONAL UNIVERSITY OF SINGAPORE (Singapore)

b SACRED HEART UNIVERSITY (United States)

c Rheinland Pfälzische Technische Universität Kaiserslautern Landau (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; CONFORMAL MAPPING; NATURAL LANGUAGE PROCESSING SYSTEMS; RECURSIVE FUNCTIONS; SET THEORY; TEXT PROCESSING; THEOREM PROVING; TOPOLOGY;

INTRINSIC COMPLEXITY; LANGUAGE LEARNING; WEAK REDUCTIONS MAPPING;

LEARNING SYSTEMS;

EID: 0035521361 PISSN: 00220000 EISSN: None Source Type: Journal
DOI: 10.1006/jcss.2001.1759 Document Type: Article

Times cited : (10)

References (27)

1
- 0016521417
- Toward a mathematical theory of inductive inference
- (1975) Inform. and Control , vol.28 , pp. 125-155
- Blum, L.¹ Blum, M.²

2
- 0000715529
- On the prediction of general recursive functions
- (1972) Soviet Math. Dokl. , vol.13 , pp. 1224-1228
- Bãrzdinš, J.¹ Freivalds, R.²

3
- 84926396434
- A machine-independent theory of the complexity of recursive functions
- (1967) J. Assoc. Comput. Math. , vol.14 , pp. 322-336
- Blum, M.¹

4
- 0008667094
- The power of vacillation
- (D. Haussler and L. Pitt, Eds.); Morgan Kaufmann, San Mateo, CA
- (1988) Proceedings of the Workshop on Computational Learning Theory , pp. 133-142
- Case, J.¹

5
- 85037033731
- Machine inductive inference and language identification
- (M. Nielsen and E. M. Schmidt, Eds.), Lecture Notes in Computer Science; Springer-Verlag, Berlin/New York
- (1982) Proceedings of the 9th International Colloquium on Automata, Languages and Programming , vol.140 , pp. 107-115
- Case, J.¹ Lynes, C.²

6
- 0000210140
- Comparison of identification criteria for machine inductive inference
- (1983) Theoret. Comput. Sci. , vol.25 , pp. 193-220
- Case, J.¹ Smith, C.²

7
- 0022693875
- On the complexity of inductive inference
- (1986) Inform. and Control , vol.69 , pp. 12-40
- Daley, R.¹ Smith, C.²

8
- 0015316806
- Some decidability results on grammatical inference and complexity
- (1972) Inform. and Control , vol.20 , pp. 244-262
- Feldman, J.¹

9
- 0002436501
- On the intrinsic complexity of learning
- (1995) Inform. and Comput. , vol.123 , pp. 64-71
- Freivalds, R.¹ Kinber, E.² Smith, C.³

10
- 0002817223
- Inductive inference of recursive functions: Qualitative theory
- (J. Bãrzdinš and D. Bjorner, Eds.), Lecture Notes in Computer Science; Springer-Verlag, Berlin/New York
- (1991) Baltic Computer Science , vol.502 , pp. 77-110
- Freivalds, R.¹

11
- 0025399572
- Prudence and other conditions on formal language learning
- (1990) Inform. and Comput. , vol.85 , pp. 1-11
- Fulk, M.¹

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

13
- 0003620778
- Addison-Wesley, Reading, MA
- (1979) Introduction to Automata Theory, Languages, and Computation
- Hopcroft, J.¹ Ullman, J.²

14
- 4243364440
- On intrinsic complexity of learning geometrical concepts from texts
- Technical Report TRB6/99, School of Computing, National University of Singapore
- (1999)
- Jain, S.¹ Kinber, E.²

15
- 0003731307
- MIT Press, Cambridge, MA
- (1999) Systems That Learn: An Introduction to Learning Theory, Second Ed.
- Jain, S.¹ Osherson, D.² Royer, J.³ Sharma, A.⁴

16
- 0028482660
- Characterizing language learning by standardizing operations
- (1994) J. Comput. System Sci. , vol.49 , pp. 96-107
- Jain, S.¹ Sharma, A.²

17
- 0030168579
- The intrinsic complexity of language identification
- (1996) J. Comput. System Sci. , vol.52 , pp. 393-402
- Jain, S.¹ Sharma, A.²

18
- 0031325871
- The structure of intrinsic complexity of learning
- (1997) J. Symbol. Logic , vol.62 , pp. 1187-1201
- Jain, S.¹ Sharma, A.²

19
- 0008648933
- On comparison of limit identification and limit standardization of general recursive functions
- (1975) Uch. Zap. Latv. Univ. , vol.233 , pp. 45-56
- Kinber, E.¹

20
- 84956519648
- Monotonicity versus efficiency for learning languages from texts
- (S. Arikawa and K. Jantke, Eds.), Lecture Notes in Artificial Intelligence; Springer-Verlag, Berlin/New York
- (1994) Algorithmic Learning Theory: Fourth International Workshop on Analogical and Inductive Inference (AII '94) and Fifth International Workshop on Algorithmic Learning Theory (ALT '94) , vol.872 , pp. 395-406
- Kinber, E.¹

21
- 0033281133
- On the intrinsic complexity of learning recursive functions
- ACM Press, New York
- (1999) Proceedings of the Twelfth Annual Conference on Computational Learning Theory , pp. 257-266
- Kinber, E.¹ Papazian, C.² Smith, C.³ Wiehagen, R.⁴

22
- 0001427402
- Language learning from texts: Mind changes, limited memory and monotonicity
- (1995) Inform. and Comput. , vol.123 , pp. 224-241
- Kinber, E.¹ Stephan, F.²

23
- 0008649923
- Learning recursive languages with a bounded number of mind changes
- (1993) Int. J. Foundations Comput. Sci. , vol.4 , pp. 157-178
- Lange, S.¹ Zeugmann, T.²

24
- 0003738723
- North-Holland, New York
- (1978) An Introduction to the General Theory of Algorithms
- Machtey, M.¹ Young, P.²

25
- 0000735770
- Criteria of language learning
- (1982) Inform. and Control , vol.52 , pp. 123-138
- Osherson, D.¹ Weinstein, S.²

26
- 0004138172
- McGraw-Hill, New York; Reprinted, MIT Press
- (1967) Theory of Recursive Functions and Effective Computability
- Rogers, H.¹

27
- 0008647514
- On the complexity of program synthesis from examples
- (1986) J. Inform. Process. Cybernetics (EIK) , vol.22 , pp. 305-323
- Wiehagen, R.¹

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