Ordinal mind change complexity of language identification

Theoretical Computer Science

Volumn 220, Issue 2, 1999, Pages 323-343

  Ambainis, Andris ^a   Jain, Sanjay ^b   Sharma, Arun ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Inductive inference; Mind change complexity; Ordinals

Indexed keywords

EID: 0000475178     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00005-5     Document Type: Article

References (34)

1. A. Ambainis, Power of procrastination in inductive inference: How it depends on used ordinal notations, in: P. Vitányi (Ed.), 2nd European Conf. on Computational Learning Theory, Lecture Notes in Artificial Intelligence, vol. 904, Springer, Berlin, 1995, pp. 99-111.
2. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980) 46-62.
3. D. Angluin, Inductive inference of formal languages from positive data, Inform, and Control 45 (1980) 117-135.
4. S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, A. Yamamoto, Algorithmic learning theory with elementary formal systems, IEICE Trans. Inform. Systems E75-D 4 (1992) 405-414.
5. J. Bārzdiņš, K. Podnieks, The theory of inductive inference, in: 2nd Symp. on Mathematical Foundations of Computer Science, Math. Inst. of the Slovak Academy of Sciences, 1973, pp. 9-15.
6. J. Case, S. Jain, M. Suraj, Not-so-nearly-minimal-size program inference, in: K. Jantke, S. Lange (Eds.), Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence, vol. 961, Springer, Berlin, 1995, pp. 77-96.
7. J. Case, C. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25 (1983) 193-220.
8. R. Daley, C. Smith, On the complexity of inductive inference, Inform. and Control 69 (1986) 12-40.
9. R. Freivalds, C. Smith, On the role of procrastination in machine learning, Inform. and Comput. 107 (1993) pp. 237-271.
10. E.M. Gold, Language identification in the limit, Inform. and Control 10 (1967) 447-474.
11. S. Jain, A. Sharma, On the intrinsic complexity of language identification, in: Proc. 7th Annual Conf. on Computational Learning Theory, ACM, New York, 1994, pp. 278-286.
12. S. Jain, A. Sharma, Elementary formal systems, intrinsic complexity, and procrastination, in: Proc. 9th Annual Conf. on Computational Learning Theory, ACM, 1996, New York, pp. 181-192.
13. S. Jam, A. Sharma, The intrinsic complexity of language identification, J. Comput. System Sci. 52 (1996) 393-402.
14. S. Jain, A. Sharma, Elementary formal systems, intrinsic complexity, and procrastination, Inform. and Comput. 132 (1997) 65-84.
15. S. Jain, A. Sharma. The structure of intrinsic complexity of learning, J. Symbolic Logic 62 (1997) 1187-1201.
16. K. Jantke, Monotonic and non-monotonic inductive inference, New Gen. Comput. 8 (1991) 349-360.
17. S. Kapur, Monotonic language learning, in: S. Doshita, K. Furukawa, K. Jantke, T. Nishida (Eds.), Algorithmic Learning Theory: 3rd Internat. Workshop (ALT '92), Lecture Notes in Artificial Intelligence, vol. 743, Springer, Berlin, 1992, pp. 147-158.
18. P. Kilpelāinen, H. Mannila, E. Ukkonen, MDL learning of unions of simple pattern languages from positive examples, in: P. Vitányi (Ed.), 2nd European Conf. on Computational Learning Theory, Lecture Notes in Artificial Intelligence, vol. 904, Springer, Berlin, 1995, pp. 252-260.
19. S. Kleene, Notations for ordinal numbers, J. Symbolic Logic 3 (1938) 150-155.
20. S. Lange, T. Zeugmann, Monotonic versus non-monotonic language learning, in: Proc 2nd Internat. Workshop on Nonmonotonic and Inductive Logic, Lecture Notes in Artificial Intelligence, vol. 659, Springer, Berlin, 1993, pp. 254-269.
21. S. Lange, T. Zeugmann, S. Kapur, Monotonic and dual monotonic language learning, Theoret. Comput. Sci. A 155 (1996) 365-410.
22. M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978.
23. T. Motoki, T. Shinohara, K. Wright, The correct definition of finite elasticity: corrigendum to identification of unions, in: L. Valiant, M. Warmuth (Eds.), Proc. 4th Annual Workshop on Computational Learning Theory, Morgan Kaufmann, Los Altos, CA, 1991, p. 375.
24. Y. Mukouchi, Inductive inference of an approximate concept from positive data, in: S. Arikawa, K. Jantke (Eds.), Algorithmic learning theory: 4th Internat. Workshop on Analogical and Inductive Inference (All '94) and 5th Internat. Workshop on Algorithmic Learning Theory (ALT '94), Lecture Notes in Artificial Intelligence, vol. 872, Springer, Berlin, 1994, pp. 484-499.
25. D. Osherson, M. Stob, S. Weinstein, Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists, MIT Press, Cambridge, MA, 1986.
26. L. Pitt, Inductive inference, DFAs, and computational complexity, in: Analogical and Inductive Inference, Proc. 2nd Internat. Workshop (All '89), Lecture Notes in Artificial Intelligence, vol. 397, Springer, Berlin, 1989, pp. 18-44.
27. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967. Reprinted by MIT Press. Cambridge, MA, 1987.
28. G. Sacks, Higher Recursion Theory, Springer, Berlin, 1990.
29. M. Sato, T. Moriyama, Inductive inference of length bounded EFS's from positive data, Technical Report DMSIS-RR-94-2, Department of Mathematical Sciences and Information Sciences, University of Osaka Prefecture, Japan, 1994.
30. R.E. Schapire, Pattern languages are not learnable, in: M. Fulk, J. Case (Eds.), Proc. 3rd Annual Workshop on Computational Learning Theory, Morgan Kaufmann, Los Altos, CA, 1990, pp. 122-129.
31. T. Shinohara, Studies on inductive inference from positive data, PhD thesis, Kyushu University, Kyushu, Japan, 1986.
32. T. Shinohara, Rich classes inferable from positive data: Length-bounded elementary formal systems, Inform, and Comput. 108 (1994) 175-186.
33. K. Wright, Identification of unions of languages drawn from an identifiable class, in: R. Rivest, D. Haussler, M. Warmuth (Eds.), Proc 2nd Annual Workshop on Computational Learning Theory, Morgan Kaufmann, Los Altos, CA, 1989, pp. 328-333.
34. T. Zeugmann, S. Lange, A guided tour across the boundaries of learning recursive languages, in: K. Jantke, S. Lange (Eds.), Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence, vol. 961, Springer, Berlin, 1995, pp. 190-258.