( en | de | ru )

 

Disambiguation of "Jain, Sanjay"

Author of the publication

copydeleteadd this publication to your clipboard
The Intrinsic Complexity of Language Identification.

, and . J. Comput. Syst. Sci., 52 (3): 393-402 (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sanjay Kumar Jain

Sanjay Kashikar

Sanjay Shahi

Sanjay Kumar

Sanjay Chahar

 

Other publications of authors with the same name

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations., , and . COLT, page 47-58. Morgan Kaufmann, (2000)Machine Learning of Higher-Order Programs., , , and . J. Symb. Log., 59 (2): 486-500 (1994)Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability., , , and . J. Comb. Optim., 17 (4): 400-416 (2009)Strong Separation of Learning Classes., , and . AII, volume 642 of Lecture Notes in Computer Science, page 129-139. Springer, (1992)Not-So-Nearly-Minimal-Size Program Inference., , and . GOSLER Final Report, volume 961 of Lecture Notes in Computer Science, page 76-95. Springer, (1995)On the Power of Learning Robustly., , and . COLT, page 187-197. ACM, (1998)One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples., and . ALT, volume 4754 of Lecture Notes in Computer Science, page 257-271. Springer, (2007)Learning Languages in a Union., , and . ALT, volume 2225 of Lecture Notes in Computer Science, page 235-250. Springer, (2001)Special issue on the conference Theory and Applications of Models of Computation., , and . Inf. Comput., (2017)Automatic learning from positive data and negative counterexamples., , and . Inf. Comput., (2017)