Efim B. Kinber

According to our database1, Efim B. Kinber authored at least 79 papers between 1977 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Automatic learning from positive data and negative counterexamples.
Inf. Comput., 2017

2016
Intrinsic Complexity of Partial Learning.
Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2014
Learning from Positive Data and Negative Counterexamples: A Survey.
Proceedings of the Computing with New Resources, 2014

Parallel Learning of Automatic Classes of Languages.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2012
Mind Change Speed-up for Learning Languages from Positive Data.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Automatic Learning from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2010
Learning Regular Expressions from Representative Examples and Membership Queries.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

Inductive Inference of Languages from Samplings.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Iterative Learning from Texts and Counterexamples Using Additional Information.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
On Learning Regular Expressions and Patterns Via Membership and Correction Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
Learning languages from positive data and a limited number of short counterexamples.
Theor. Comput. Sci., 2007

One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Iterative Learning from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

Learning and Extending Sublanguages.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
Variations on U-Shaped Learning.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Learning Multiple Languages in Groups.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
On the classification of recursive languages.
Inf. Comput., 2004

Learning Languages from Positive Data and a Finite Number of Queries.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Learning Languages from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
On learning of functions refutably.
Theor. Comput. Sci., 2003

On the intrinsic complexity of learning recursive functions.
Inf. Comput., 2003

Learning All Subfunctions of a Function.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2001
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations.
J. Comput. Syst. Sci., 2001

Intrinsic Complexity of Learning Geometrical Concepts from Positive Data.
Proceedings of the Computational Learning Theory, 2001

Learning Recursive Functions Refutably.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000
Learning languages and functions by erasing.
Theor. Comput. Sci., 2000

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations.
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.
J. Exp. Theor. Artif. Intell., 1999

On the Intrinsic Complexity of Learning Recursive Functions.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

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

1996
On Learning and Co-learning of Minimal Programs.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
How Inductive Inference Strategies Discover Their Errors
Inf. Comput., May, 1995

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

Learning via Queries with Teams and Anomalies.
Fundam. Inform., 1995

Frequency Computation and Bounded Queries
Electronic Colloquium on Computational Complexity (ECCC), 1995

Learning from Good Examples.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Error Detecting in Inductive Inference.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Probabilistic versus Deterministic Memory Limited Learning.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

On the intrinsic complexity of learning.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Learning recursive functions from approximations.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract).
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Frequency Computation and Bounded Queries.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
Extremes in the Degrees of Inferability.
Ann. Pure Appl. Logic, 1994

Monotonicity versus Efficiency for Learning Languages from Texts.
Proceedings of the Algorithmic Learning Theory, 1994

1993
On the Power of Inductive Inference from Good Examples.
Theor. Comput. Sci., 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On Learning Multiple Concepts in Parallel.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On the Impact of Forgetting on Learning Machines.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

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

Learning A Class of Regular Expressions via Restricted Subset Queries.
Proceedings of the Analogical and Inductive Inference, 1992

1991
One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification
Inf. Comput., June, 1991

On Complete Sets of Samples for Generalized Regular Expressions.
Theor. Comput. Sci., 1991

Dual Types of Hypotheses in Inductive Inference.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

Some Models of Inductive Syntactical Synthesis from Sample Computations.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990
Models of Inductive Synthesis.
J. Log. Program., 1990

Learning Via Queries With Teams and Anomilies.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Some Problems of Learning with an Oracle.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Inductive Synthesis of Programs for Recursive Functions from Sample Computations.
Elektronische Informationsverarbeitung und Kybernetik, 1989

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings.
Elektronische Informationsverarbeitung und Kybernetik, 1989

Monte-Carlo Inference and Its Relations to Reliable Frequency Identification.
Proceedings of the Fundamentals of Computation Theory, 1989

Refined Query Inference (Extended Abstract).
Proceedings of the Analogical and Inductive Inference, 1989

Inductive Inference from Good Examples.
Proceedings of the Analogical and Inductive Inference, 1989

1988
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.
Math. Log. Q., 1988

Inductive Synthesis of Algorithms for Graphs from Sample Computations.
Elektronische Informationsverarbeitung und Kybernetik, 1988

Inductive Syntactical Synthesis of Programs from Sample Computations.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1986
Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops.
Theor. Comput. Sci., 1986

On the equivalence of grammars inferred from derivation.
Bulletin of the EATCS, 1986

1985
Three-way automata on rectangular tapes over a one-letter alphabet.
Inf. Sci., 1985

On Separation of the Emptiness and Equivalence Problems for Program Schemes.
Inf. Process. Lett., 1985

Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies.
Elektronische Informationsverarbeitung und Kybernetik, 1985

1984
On the Power of Probabilistic Strategies in Inductive Inference.
Theor. Comput. Sci., 1984

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings.
Math. Log. Q., 1984

1983
The Inclusion Problem for some Classes of Deterministic Multitape Automata.
Theor. Comput. Sci., 1983

A Note on Limit Identification of c-minimal Indices.
Elektronische Informationsverarbeitung und Kybernetik, 1983

1982
Inductive Inference and Computable One-One Numberings.
Math. Log. Q., 1982

1980
On Inclusion Problem for Deterministic Multitape Automata.
Inf. Process. Lett., 1980

1977
On a Theory of Inductive Inference.
Proceedings of the Fundamentals of Computation Theory, 1977


  Loading...