The intrinsic complexity of language identification

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 393-402

  Jain, Sanjay ^a   Sharma, Arun ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; LEARNING ALGORITHMS; LEARNING SYSTEMS; RECURSIVE FUNCTIONS;

INTRINSIC COMPLEXITY; LANGUAGE IDENTIFICATION;

COMPUTATIONAL COMPLEXITY;

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

References (19)

1. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980), 46-62.
2. D. Angluin, Inductive inference of formal languages from positive data, Inform. and Control 45 (1980), 117-135.
3. M. Blum, A machine independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14 (1967), 322-336.
4. J. Case, Periodicity in generations of automata, Math. Systems Theory 8 (1974), 15-32.
5. J. Case, The power of vacillation, in "Proceedings, Workshop on Computational Learning Theory" (D. Haussler and L. Pitt, Eds.), pp. 133-142, Morgan Kaufmann, San Mateo, CA, 1988; expanded in [6].
6. J. Case, "The Power of Vacillation in Language Learning," Technical Report 93-08, University of Delaware; expands on [5]; journal article under review.
7. J. Case and C. Lynes, Machine inductive inference and language identification, in "Proceedings, 9th International Colloquium on Automata, Languages and Programming" (M. Nielsen and E. M. Schmidt, Eds.), pp. 107-115, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, New York/Berlin, 1982.
8. J. Feldman, Some decidability results on grammatical inference and complexity, Inform. and Control 20 (1972), 244-262.
9. R. Freivalds, Inductive of recursive functions: Qualitative theory, in "Baltic Computer Science" (J. Barzdins and D. Bjorner, Eds.), Lecture Notes in Computer Science, Vol. 502, pp. 77-110, Springer-Verlag, New York/Berlin, 1991.
10. R. Freivalds, E. Kinber, and C. H. Smith, "On the Intrinsic Complexity of Learning," in "Proceedings, Computational Learning Theory, Second European Conference" (P. Vitányi, Ed.), Lecture Notes in Artificial Intelligence, Vol. 904, pp. 154-168, Springer-Verlag, New York/Berlin, 1995.
11. E. M. Gold, Language identification in the limit, Inform. and Control 10 (1967), 447-474.
12. J. Hopcroft and J. Ullman, "Introduction to Automata Theory Languages and Computation," Addison-Wesley, Reading, MA, 1979.
13. S. Jain and A. Sharma, On the intrinsic complexity of language identification, in "Proceedings, Seventh Annual Conference on Computational Learning Theory, New Brunswick, NJ," pp. 278-286, ACM Press, New York, 1994.
14. S. Jain and A. Sharma, The structure of intrinsic complexity of learning, in "Proceedings, Second European Conference on Computational Learning Theory, March 1995" (Paul Vitányi, Ed.), Lecture Notes in Artificial Intelligence, Vol. 904, pp. 169-181, Springer-Verlag, New York/Berlin, 1995.
15. M. Machtey and P. Young, "An Introduction to the General Theory of Algorithms," North-Holland, New York, 1978.
16. D. Osherson, M. Stob, and S. Weinstein, "Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists," MIT Press, Cambridge, MA, 1986.
17. D. Osherson and S. Weinstein, Criteria of language learning, Inform. and Control 52 (1982), 123-138.
18. H. Rogers, "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York, 1967; reprinted, MIT Press, Cambridge, MA, 1987.
19. R. Wiehagen, Identification of formal languages, in "Mathematical Foundations of Computer Science, Proceedings, 6th Symposium, Tatranska Lomnica," pp. 571-579, Lecture Notes in Computer Science, Vol. 53, Springer-Verlag, New York/Berlin, 1977.