Learning and Extending Sublanguages

  • Sanjay Jain
  • Efim Kinber
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4264)


A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the target language is available. Examples of language families are exhibited that are learnable in one model and not learnable in another one. Some characterizations for learnability of algorithmically enumerable families of languages for the models in question are obtained. Since learnability of any part of the target language does not imply monotonicity of the learning process, we consider also our models under additional monotonicity constraint.


Initial Segment Target Language Recursive Function Inductive Inference Restrictive Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ang80a]
    Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)MATHCrossRefMathSciNetGoogle Scholar
  2. [Ang80b]
    Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)MATHCrossRefMathSciNetGoogle Scholar
  3. [Bār74a]
    Bārzdiņš, J.: Inductive inference of automata, functions and programs. In: Int. Math. Congress, Vancouver, pp. 771–776 (1974)Google Scholar
  4. [Bār74b]
    Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs. Latvian State University, vol. 1, pp. 82–88, 1974 (in Russian)Google Scholar
  5. [BB75]
    Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)MATHCrossRefMathSciNetGoogle Scholar
  6. [CL82]
    Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  7. [CS83]
    Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 193–220 (1983)MATHCrossRefMathSciNetGoogle Scholar
  8. [FJ96]
    Fulk, M., Jain, S.: Learning in the presence of inaccurate information. Theoretical Computer Science A 161, 235–261 (1996)MATHCrossRefMathSciNetGoogle Scholar
  9. [Ful85]
    Fulk, M.: A Study of Inductive Inference Machines. PhD thesis, SUNY/Buffalo (1985)Google Scholar
  10. [Gol67]
    Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)MATHCrossRefGoogle Scholar
  11. [Jan91]
    Jantke, K.: Monotonic and non-monotonic inductive inference. New Generation Computing 8, 349–360 (1991)MATHCrossRefGoogle Scholar
  12. [JKW04]
    Jain, S., Kinber, E., Wiehagen, R.: Learning all subfunctions of a function. Information and Computation 192(2), 185–215 (2004)MATHCrossRefMathSciNetGoogle Scholar
  13. [KY95]
    Kobayashi, S., Yokomori, T.: On approximately identifying concept classes in the limit. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS (LNAI), vol. 997, pp. 298–312. Springer, Heidelberg (1995)Google Scholar
  14. [Muk94]
    Mukouchi, Y.: Inductive inference of an approximate concept from positive data. In: Arikawa, S., Jantke, K.P. (eds.) AII 1994 and ALT 1994. LNCS (LNAI), vol. 872, pp. 484–499. Springer, Heidelberg (1994)Google Scholar
  15. [OSW86]
    Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)Google Scholar
  16. [OW82a]
    Osherson, D., Weinstein, S.: Criteria of language learning. Information and Control 52, 123–138 (1982)MATHCrossRefMathSciNetGoogle Scholar
  17. [OW82b]
    Osherson, D., Weinstein, S.: A note on formal learning theory. Cognition 11, 77–88 (1982)CrossRefGoogle Scholar
  18. [Rog67]
    Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); Reprinted by MIT Press in 1987MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sanjay Jain
    • 1
  • Efim Kinber
    • 2
  1. 1.School of ComputingNational University of SingaporeSingapore
  2. 2.Department of Computer ScienceSacred Heart UniversityFairfieldU.S.A.

Personalised recommendations