Sanjay Jain

From MaRDI portal
Person:197705

Available identifiers

zbMath Open jain.sanjayMaRDI QIDQ197705

List of research outcomes

PublicationDate of PublicationType
Learnability and positive equivalence relations2024-02-02Paper
Machine induction without revolutionary paradigm shifts2023-12-08Paper
Alternating automatic register machines2023-07-28Paper
Addition machines, automatic functions and open problems of Floyd and Knuth2023-06-12Paper
https://portal.mardi4nfdi.de/entity/Q58756502023-02-03Paper
String compression in FA-presentable structures2023-02-01Paper
Lamplighter groups and automata2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50923842022-07-21Paper
A computation model with automatic functions and relations as primitive operations2022-06-13Paper
Deciding Parity Games in Quasi-polynomial Time2022-05-03Paper
Learners based on transducers2022-03-14Paper
On the amount of nonconstructivity in learning formal languages from text2021-11-25Paper
Bi-immunity over different size alphabets2021-11-11Paper
Learnability and positive equivalence relations2021-10-04Paper
Ordered semiautomatic rings with applications to geometry2020-07-27Paper
Searching for shortest and least programs2020-01-22Paper
Exact satisfiabitity with jokers2019-10-15Paper
Reductions between types of numberings2019-10-07Paper
The isomorphism problem for tree-automatic ordinals with addition2019-09-20Paper
Intrinsic complexity of partial learning2019-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46176152019-02-06Paper
The complexity of verbal languages over groups2019-01-25Paper
https://portal.mardi4nfdi.de/entity/Q46456422019-01-10Paper
Finitely generated semiautomatic groups2018-09-20Paper
Learning pattern languages over groups2018-08-22Paper
Learners based on transducers2018-06-26Paper
Effectivity questions for Kleene's recursion theorem2018-06-05Paper
Semiautomatic structures2018-02-01Paper
Regular patterns, regular languages and context-free languages2017-11-03Paper
Enumerations including laconic enumerators2017-10-17Paper
Deciding parity games in quasipolynomial time2017-08-17Paper
Automatic learning from positive data and negative counterexamples2017-08-08Paper
A Survey on Recent Results on Partial Learning2017-06-09Paper
The Complexity of Verbal Languages over Groups2017-05-16Paper
Closed left-r.e. sets2017-02-23Paper
https://portal.mardi4nfdi.de/entity/Q29550132017-01-24Paper
Priced Learning2016-11-30Paper
Enlarging learnable classes2016-11-18Paper
Intrinsic Complexity of Partial Learning2016-11-09Paper
Learning Pattern Languages over Groups2016-11-09Paper
Parallel learning of automatic classes of languages2016-10-21Paper
Inductive inference and reverse mathematics2016-10-10Paper
Finitely Generated Semiautomatic Groups2016-08-17Paper
On a question of nearly minimal identification of functions2016-06-16Paper
Tree-automatic scattered linear orders2016-03-31Paper
On the role of update constraints and text-types in iterative learning2016-03-10Paper
Learning Automatic Families of Languages2016-03-10Paper
Effectivity Questions for Kleene’s Recursion Theorem2015-12-11Paper
Learning from Positive Data and Negative Counterexamples: A Survey2015-09-08Paper
Graphs realised by r.e. equivalence relations2015-06-17Paper
MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY2015-04-29Paper
On the Role of Update Constraints and Text-Types in Iterative Learning2015-01-14Paper
Parallel Learning of Automatic Classes of Languages2015-01-14Paper
Semiautomatic Structures2014-06-24Paper
Robust learning of automatic classes of languages2014-02-13Paper
Automatic learners with feedback queries2014-02-13Paper
Learning and classifying2014-01-09Paper
Mind change speed-up for learning languages from positive data2013-12-19Paper
Editors’ Introduction2013-11-06Paper
Automatic functions, linear time and learning2013-09-26Paper
On Conservative Learning of Recursively Enumerable Languages2013-08-05Paper
ON AUTOMATIC FAMILIES2013-06-03Paper
Learning without coding2013-03-04Paper
Automatic learning of subclasses of pattern languages2012-11-27Paper
Learnability of automatic classes2012-11-06Paper
Enlarging Learnable Classes2012-10-16Paper
Automatic Learning from Positive Data and Negative Counterexamples2012-10-16Paper
https://portal.mardi4nfdi.de/entity/Q29047752012-08-23Paper
Learning with ordinal-bounded memory from positive data2012-08-17Paper
Automatic Functions, Linear Time and Learning2012-08-14Paper
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data2012-07-16Paper
Iterative learning from texts and counterexamples using additional information2012-05-08Paper
Rice and Rice-Shapiro Theorems for transfinite correction grammars2011-11-07Paper
Robust Learning of Automatic Classes of Languages2011-10-19Paper
Learning and Classifying2011-10-19Paper
Automatic Learners with Feedback Queries2011-09-09Paper
Hypothesis spaces for learning2011-07-27Paper
Closed Left-R.E. Sets2011-07-01Paper
Automatic Learning of Subclasses of Pattern Languages2011-06-03Paper
Index sets and universal numberings2011-04-28Paper
Uncountable automatic classes and learning2011-04-14Paper
Inductive Inference of Languages from Samplings2010-10-01Paper
On some open problems in monotonic and conservative learning2010-08-20Paper
Index Sets and Universal Numberings2010-07-28Paper
Iterative learning of simple external contextual languages2010-07-07Paper
Incremental learning with temporary memory2010-07-07Paper
On some open problems in reflective inductive inference2010-06-16Paper
Learnability of Automatic Classes2010-05-26Paper
Numberings optimal for learning2010-05-25Paper
Vacillatory and BC learning on noisy data2010-04-27Paper
On learning and co-learning of minimal programs2010-04-27Paper
Learning Theory and Kernel Machines2010-03-23Paper
Learning Theory and Kernel Machines2010-03-23Paper
Learning Theory and Kernel Machines2010-03-23Paper
Algorithmic Learning Theory2010-02-23Paper
Uncountable Automatic Classes and Learning2009-12-01Paper
Iterative Learning from Texts and Counterexamples Using Additional Information2009-12-01Paper
Learning from Streams2009-12-01Paper
Input-dependence in function-learning2009-10-19Paper
Mitotic Classes in Inductive Inference2009-08-20Paper
One-shot learners using negative counterexamples and nearest positive examples2009-07-10Paper
Learning correction grammars2009-06-04Paper
Prescribed learning of r.e. classes2009-05-12Paper
Hypothesis Spaces for Learning2009-04-02Paper
Iterative Learning of Simple External Contextual Languages2008-10-14Paper
Numberings Optimal for Learning2008-10-14Paper
Learning and Extending Sublanguages2008-09-04Paper
Iterative Learning from Positive Data and Negative Counterexamples2008-09-04Paper
Towards a Better Understanding of Incremental Learning2008-09-04Paper
Learning in Friedberg numberings2008-08-22Paper
Prescribed Learning of R.E. Classes2008-08-19Paper
Learning in Friedberg Numberings2008-08-19Paper
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples2008-08-19Paper
https://portal.mardi4nfdi.de/entity/Q35058952008-06-11Paper
Non-U-shaped vacillatory and team learning2008-06-10Paper
Learning languages from positive data and negative counterexamples2008-06-10Paper
Absolute versus probabilistic classification in a logical setting2008-05-28Paper
Learning and extending sublanguages2008-05-28Paper
Learning languages from positive data and a limited number of short counterexamples2008-01-07Paper
Learning Correction Grammars2008-01-03Paper
Mitotic Classes2008-01-03Paper
A general comparison of language learning from examples and from queries2007-12-19Paper
Learning multiple languages in groups2007-12-19Paper
Iterative learning from positive data and negative counterexamples2007-12-10Paper
Some natural conditions on incremental learning2007-11-21Paper
Input-Dependence in Function-Learning2007-11-13Paper
Results on memory-limited U-shaped learning2007-10-10Paper
Invertible classes2007-09-28Paper
Memory-Limited U-Shaped Learning2007-09-14Paper
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples2007-09-14Paper
https://portal.mardi4nfdi.de/entity/Q34344872007-05-02Paper
Theory and Applications of Models of Computation2007-04-30Paper
Theory and Applications of Models of Computation2007-04-30Paper
Learning languages in a union2007-01-22Paper
Learning a subclass of regular patterns in polynomial time2007-01-09Paper
Algorithmic Learning Theory2006-11-01Paper
Algorithmic Learning Theory2006-11-01Paper
Algorithmic Learning Theory2006-11-01Paper
Algorithmic Learning Theory2006-11-01Paper
Grammatical Inference: Algorithms and Applications2006-10-20Paper
Variations on U-shaped learning2006-08-17Paper
Learning Theory2006-06-22Paper
Identifying Clusters from Positive Data2006-06-01Paper
Generality's price: Inescapable deficiencies in machine-learned programs2006-04-28Paper
Learning languages from positive data and a finite number of queries2006-04-28Paper
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms2005-10-10Paper
Parsimony hierarchies for inductive inference2005-08-29Paper
Algorithmic Learning Theory2005-08-18Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
Counting extensional differences in BC-learning2004-11-23Paper
Robust learning -- rich and poor2004-10-01Paper
Intrinsic complexity of learning geometrical concepts from positive data2004-08-19Paper
Learning all subfunctions of a function2004-08-10Paper
Classes with easily learnable subclasses2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44735552004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44735562004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44735572004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44735602004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44705632004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44705642004-07-01Paper
Learning how to separate.2004-03-14Paper
Learning by switching type of information.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44539282004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44207522003-08-18Paper
On the intrinsic complexity of learning recursive functions2003-07-29Paper
On learning of functions refutably.2003-05-22Paper
The synthesis of language learners.2003-01-14Paper
Incremental concept learning for bounded data mining.2003-01-14Paper
Robust behaviorally correct learning.2003-01-14Paper
On a generalized notion of mistake bounds2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q31488032002-09-22Paper
https://portal.mardi4nfdi.de/entity/Q31488052002-09-22Paper
Mind change complexity of learning logic programs2002-07-15Paper
Language learning from texts: Degrees of intrinsic complexity and their characterizations2002-07-04Paper
Control structures in hypothesis spaces: The influence on learning2002-03-03Paper
Predictive learning models for concept drift2002-03-03Paper
Some independence results for control structures in complete numberings2002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q27578482001-12-04Paper
https://portal.mardi4nfdi.de/entity/Q27578522001-12-04Paper
Synthesizing learners tolerating computable noisy data2001-09-09Paper
Robust learning is rich2001-09-09Paper
Branch and bound on the network model2001-08-20Paper
Costs of general purpose learning2001-08-20Paper
On the learnability of recursively enumerable languages from good examples2001-08-20Paper
Synthesizing noise-tolerant language learners2001-08-20Paper
On an open problem in classification of languages2001-01-01Paper
Team learning of computable languages2000-09-05Paper
Ordinal mind change complexity of language identification2000-08-23Paper
Learning languages and functions by erasing2000-08-21Paper
Vacillatory and BC learning on noisy data2000-08-21Paper
Robust learning aided by context2000-07-24Paper
Prudence in vacillatory language identification2000-07-06Paper
Program size restrictions in computational learning2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42470122000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42470082000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42470132000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42678331999-10-20Paper
Learning with refutation1999-02-21Paper
Generalization and specialization strategies for learning r. e. languages1999-01-06Paper
The structure of intrinsic complexity of learning1998-09-02Paper
Kolmogorov numberings and minimal identification1998-06-30Paper
https://portal.mardi4nfdi.de/entity/Q43702151998-05-25Paper
Learning from Multiple Sources of Inaccurate Data1998-02-10Paper
Computational limits on team identification of languages1997-10-13Paper
On aggregating teams of learning machines1997-09-29Paper
Characterizing language identification in terms of computable numberings1997-06-11Paper
Program synthesis in the presence of infinite number of inaccuracies1997-03-18Paper
Elementary formal systems, intrinsic complexity, and procrastination1997-03-06Paper
On a question about learning nearly minimal programs1997-02-28Paper
Anomalous learning helps succinctness1997-02-27Paper
Learning in the presence of inaccurate information1997-02-27Paper
Machine induction without revolutionary changes in hypothesis size1997-02-03Paper
The intrinsic complexity of language identification1996-11-26Paper
AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS1995-12-03Paper
Language learning with some negative information1995-10-25Paper
Finite identification of functions by teams with success ratio \(\frac 12\) and above1995-10-10Paper
Complexity issues for vacillatory function identification1995-05-28Paper
Approximate inference and scientific method1995-01-11Paper
Characterizing language identification by standardizing operations1994-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43000601994-09-08Paper
Machine learning of higher-order programs1994-08-15Paper
Extremes in the degrees of inferability1994-05-03Paper
BANISHING ROBUST TURING COMPLETENESS1994-04-27Paper
https://portal.mardi4nfdi.de/entity/Q42815691994-03-10Paper
On the non-existence of maximal inference degrees for language identification1993-12-15Paper
https://portal.mardi4nfdi.de/entity/Q40386891993-05-18Paper
Learning with the knowledge of an upper bound on program size1993-05-16Paper
ON LEARNING LIMITING PROGRAMS1993-01-16Paper
ON THE LIMITATIONS OF LOCALLY ROBUST POSITIVE REDUCTIONS1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40135361992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40135371992-09-27Paper
Learning in the presence of partial explanations1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q33563001989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sanjay Jain