Efim B. Kinber

According to our database, Efim B. Kinber authored at least 77 papers between 1977 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Intrinsic complexity of partial learning.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2019

2017

Automatic learning from positive data and negative counterexamples.

Sanjay Jain, Efim B. Kinber, Frank Stephan

Inf. Comput., 2017

2016

Parallel learning of automatic classes of languages.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2016

To the Memory of R. Freivalds.

Efim B. Kinber

Balt. J. Mod. Comput., 2016

2014

Learning from Positive Data and Negative Counterexamples: A Survey.

Sanjay Jain, Efim B. Kinber

Proceedings of the Computing with New Resources, 2014

2013

Mind change speed-up for learning languages from positive data.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2013

2012

Automatic Learning from Positive Data and Negative Counterexamples.

Sanjay Jain, Efim B. Kinber

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Iterative learning from texts and counterexamples using additional information.

Sanjay Jain, Efim B. Kinber

Mach. Learn., 2011

2010

Learning Regular Expressions from Representative Examples and Membership Queries.

Efim B. Kinber

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

Inductive Inference of Languages from Samplings.

Sanjay Jain, Efim B. Kinber

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

One-shot learners using negative counterexamples and nearest positive examples.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2009

2008

Learning and extending sublanguages.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2008

Learning languages from positive data and negative counterexamples.

Sanjay Jain, Efim B. Kinber

J. Comput. Syst. Sci., 2008

On Learning Regular Expressions and Patterns Via Membership and Correction Queries.

Efim B. Kinber

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007

Learning languages from positive data and a limited number of short counterexamples.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2007

Learning multiple languages in groups.

Sanjay Jain, Efim B. Kinber

Theor. Comput. Sci., 2007

Iterative learning from positive data and negative counterexamples.

Sanjay Jain, Efim B. Kinber

Inf. Comput., 2007

2006

Learning languages from positive data and a finite number of queries.

Sanjay Jain, Efim B. Kinber

Inf. Comput., 2006

Variations on U-shaped learning.

Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan

Inf. Comput., 2006

2004

Learning all subfunctions of a function.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Inf. Comput., 2004

On the classification of recursive languages.

John Case, Efim B. Kinber, Arun Sharma, Frank Stephan

Inf. Comput., 2004

2003

On learning of functions refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2003

Intrinsic complexity of learning geometrical concepts from positive data.

Sanjay Jain, Efim B. Kinber

J. Comput. Syst. Sci., 2003

On the intrinsic complexity of learning recursive functions.

Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen

Inf. Comput., 2003

2001

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

J. Comput. Syst. Sci., 2001

Learning Recursive Functions Refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Learning languages and functions by erasing.

Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2000

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

The functions of finite support: a canonical learning problem.

Rusins Freivalds, Efim B. Kinber, Carl H. Smith

J. Exp. Theor. Artif. Intell., 1999

On the Intrinsic Complexity of Learning Recursive Functions.

Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1997

Learning Recursive Functions from Approximations.

John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer

J. Comput. Syst. Sci., 1997

On the Classification of Computable Languages.

John Case, Efim B. Kinber, Arun Sharma, Frank Stephan

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

Frequency Computation and Bounded Queries.

Richard Beigel, William I. Gasarch, Efim B. Kinber

Theor. Comput. Sci., 1996

On Learning and Co-learning of Minimal Programs.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

How Inductive Inference Strategies Discover Their Errors

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Inf. Comput., May, 1995

On Learning Multiple Concepts in Parallel.

Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen

J. Comput. Syst. Sci., 1995

On the Impact of Forgetting on Learning Machines.

Rusins Freivalds, Efim B. Kinber, Carl H. Smith

J. ACM, 1995

Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity.

Efim B. Kinber, Frank Stephan

Inf. Comput., 1995

On the Intrinsic Complexity of Learning.

Rusins Freivalds, Efim B. Kinber, Carl H. Smith

Inf. Comput., 1995

Learning via Queries with Teams and Anomalies.

William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann

Fundam. Informaticae, 1995

Learning from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Error Detecting in Inductive Inference.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Probabilistic versus Deterministic Memory Limited Learning.

Rusins Freivalds, Efim B. Kinber, Carl H. Smith

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract).

Efim B. Kinber, Frank Stephan

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Extremes in the Degrees of Inferability.

Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan

Ann. Pure Appl. Log., 1994

Monotonicity versus Efficiency for Learning Languages from Texts.

Efim B. Kinber

Proceedings of the Algorithmic Learning Theory, 1994

1993

On the Power of Inductive Inference from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Theor. Comput. Sci., 1993

On the impact of forgetting on learing machines.

Rusins Freivalds, Efim B. Kinber, Carl H. Smith

Bull. EATCS, 1993

1992

Degrees of Inferability.

Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Learning A Class of Regular Expressions via Restricted Subset Queries.

Efim B. Kinber

Proceedings of the Analogical and Inductive Inference, 1992

1991

One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification

Efim B. Kinber, Thomas Zeugmann

Inf. Comput., June, 1991

On Complete Sets of Samples for Generalized Regular Expressions.

Efim B. Kinber

Theor. Comput. Sci., 1991

Dual Types of Hypotheses in Inductive Inference.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Nonmonotonic and Inductive Logic, 1991

Some Models of Inductive Syntactical Synthesis from Sample Computations.

Efim B. Kinber

Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990

Models of Inductive Synthesis.

Efim B. Kinber, Alvis Brazma

J. Log. Program., 1990

Learning Via Queries With Teams and Anomilies.

Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Some Problems of Learning with an Oracle.

Efim B. Kinber

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Inductive Synthesis of Programs for Recursive Functions from Sample Computations.

Efim B. Kinber

J. Inf. Process. Cybern., 1989

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

J. Inf. Process. Cybern., 1989

Monte-Carlo Inference and Its Relations to Reliable Frequency Identification.

Efim B. Kinber, Thomas Zeugmann

Proceedings of the Fundamentals of Computation Theory, 1989

Refined Query Inference (Extended Abstract).

Efim B. Kinber, Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1989

Inductive Inference from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Analogical and Inductive Inference, 1989

1988

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1988

Inductive Synthesis of Algorithms for Graphs from Sample Computations.

Efim B. Kinber

J. Inf. Process. Cybern., 1988

Inductive Syntactical Synthesis of Programs from Sample Computations.

Efim B. Kinber

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1986

Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops.

Alvis Brazma, Efim B. Kinber

Theor. Comput. Sci., 1986

On the equivalence of grammars inferred from derivation.

Efim B. Kinber, Arto Salomaa, Sheng Yu

Bull. EATCS, 1986

1985

Three-way automata on rectangular tapes over a one-letter alphabet.

Efim B. Kinber

Inf. Sci., 1985

On Separation of the Emptiness and Equivalence Problems for Program Schemes.

Andrejs J. Auzins, Efim B. Kinber

Inf. Process. Lett., 1985

Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies.

Efim B. Kinber, Thomas Zeugmann

J. Inf. Process. Cybern., 1985

1984

On the Power of Probabilistic Strategies in Inductive Inference.

Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber

Theor. Comput. Sci., 1984

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1984

1983

The Inclusion Problem for some Classes of Deterministic Multitape Automata.

Efim B. Kinber

Theor. Comput. Sci., 1983

A Note on Limit Identification of c-minimal Indices.

Efim B. Kinber

J. Inf. Process. Cybern., 1983

1982

Inductive Inference and Computable One-One Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1982

1980

On Inclusion Problem for Deterministic Multitape Automata.

Efim B. Kinber

Inf. Process. Lett., 1980

1977

On a Theory of Inductive Inference.

Efim B. Kinber

Proceedings of the Fundamentals of Computation Theory, 1977