Efim Kinber

From MaRDI portal
Person:760794

Available identifiers

zbMath Open kinber.efim-bMaRDI QIDQ760794

List of research outcomes





PublicationDate of PublicationType
On the classification of computable languages2022-11-09Paper
Intrinsic complexity of partial learning2019-05-29Paper
Some models of inductive syntactical synthesis from sample computations2018-12-11Paper
Automatic learning from positive data and negative counterexamples2017-08-08Paper
Intrinsic Complexity of Partial Learning2016-11-09Paper
Parallel learning of automatic classes of languages2016-10-21Paper
Learning from Positive Data and Negative Counterexamples: A Survey2015-09-08Paper
Parallel Learning of Automatic Classes of Languages2015-01-14Paper
Mind change speed-up for learning languages from positive data2013-12-19Paper
Automatic Learning from Positive Data and Negative Counterexamples2012-10-16Paper
Mind change speed-up for learning languages from positive data2012-08-23Paper
Iterative learning from texts and counterexamples using additional information2012-05-08Paper
Inductive Inference of Languages from Samplings2010-10-01Paper
Learning Regular Expressions from Representative Examples and Membership Queries2010-09-10Paper
On learning and co-learning of minimal programs2010-04-27Paper
Learning Theory and Kernel Machines2010-03-23Paper
Iterative Learning from Texts and Counterexamples Using Additional Information2009-12-01Paper
One-shot learners using negative counterexamples and nearest positive examples2009-07-10Paper
On Learning Regular Expressions and Patterns Via Membership and Correction Queries2008-10-16Paper
Iterative Learning from Positive Data and Negative Counterexamples2008-09-04Paper
Learning and Extending Sublanguages2008-09-04Paper
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples2008-08-19Paper
Learning languages from positive data and negative counterexamples2008-06-10Paper
Learning and extending sublanguages2008-05-28Paper
Learning languages from positive data and a limited number of short counterexamples2008-01-07Paper
Learning multiple languages in groups2007-12-19Paper
Iterative learning from positive data and negative counterexamples2007-12-10Paper
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples2007-09-14Paper
Negative data in learning languages2007-05-02Paper
Algorithmic Learning Theory2006-11-01Paper
On the intrinsic complexity of learning2006-10-10Paper
Variations on U-shaped learning2006-08-17Paper
Learning Theory2006-06-22Paper
Learning languages from positive data and a finite number of queries2006-04-28Paper
Algorithmic Learning Theory2005-08-18Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
Intrinsic complexity of learning geometrical concepts from positive data2004-08-19Paper
Learning all subfunctions of a function2004-08-10Paper
On the classification of recursive languages2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44735602004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44705672004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44302962003-10-20Paper
On the intrinsic complexity of learning recursive functions2003-07-29Paper
On learning of functions refutably.2003-05-22Paper
https://portal.mardi4nfdi.de/entity/Q31488052002-09-22Paper
Language learning from texts: Degrees of intrinsic complexity and their characterizations2002-07-04Paper
Learning languages and functions by erasing2000-08-21Paper
Pattern languages with and without erasing2000-07-04Paper
The functions of finite support: a canonical learning problem1999-01-01Paper
Learning recursive functions from approximations1998-02-02Paper
On the impact of forgetting on learning machines1998-01-28Paper
Frequency computation and bounded queries1997-02-27Paper
Language learning from texts: Mindchanges, limited memory and monotonicity1996-02-26Paper
How inductive inference strategies discover their errors1995-07-10Paper
https://portal.mardi4nfdi.de/entity/Q48359031995-07-05Paper
On learning multiple concepts in parallel1995-06-08Paper
Extremes in the degrees of inferability1994-05-03Paper
https://portal.mardi4nfdi.de/entity/Q31425631994-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42029201993-09-06Paper
On the power of inductive inference from good examples1993-08-30Paper
Syntactic inductive synthesis using examples of programs with conjunctive conditions in loops1992-09-26Paper
On complete sets of samples for generalized regular expressions1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39748691992-06-26Paper
One-sided error probabilistic inductive inference and reliable frequency identification1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42050701989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47334371989-01-01Paper
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38092511988-01-01Paper
Inductive syntactic synthesis of programs with FOR loops and interpreted functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47308031988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042271988-01-01Paper
Decision problems resulting from grammatical inference1987-01-01Paper
Generalized regular expressions - a language for synthesis of programs with branching in loops1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37224851985-01-01Paper
Three-way automata on rectangular types over a one-letter alphabet1985-01-01Paper
On separation of the emptiness and equivalence problems for program schemes1985-01-01Paper
On the power of probabilistic strategies in inductive inference1984-01-01Paper
CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS1984-01-01Paper
The inclusion problem for some classes of deterministic multitape automata1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36791641983-01-01Paper
A class of multitape automata with a decidable equivalence problem1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37117521983-01-01Paper
Inductive Inference and Computable One‐One Numberings1982-01-01Paper
On inclusion problem for deterministic multitape automata1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090851980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39181531980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456991977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545481977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30504111977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41387171977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545491977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40995361976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40795951975-01-01Paper
On frequency-enumerable sets1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018031975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41000761974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018001974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018011974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018021974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56801131972-01-01Paper

Research outcomes over time

This page was built for person: Efim Kinber