| Publication | Date of Publication | Type |
|---|
| Co-learning of recursive languages from positive data | 2024-07-11 | Paper |
| On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings | 2022-12-16 | Paper |
On the amount of nonconstructivity in learning formal languages from text
Information and Computation | 2021-11-25 | Paper |
| scientific article; zbMATH DE number 7075902 (Why is no real title available?) | 2019-07-03 | Paper |
| On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference | 2019-02-06 | Paper |
| Mathematical analysis and the mathematics of computation | 2016-11-03 | Paper |
On the influence of technology on learning processes
Parallel Processing Letters | 2015-12-18 | Paper |
Active learning of recursive functions by ultrametric algorithms
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Editors' introduction
Lecture Notes in Computer Science | 2013-11-06 | Paper |
On the size complexity of deterministic frequency automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences | 2012-08-17 | Paper |
On the amount of nonconstructivity in learning formal languages from positive data
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Teaching randomized learners with feedback
Information and Computation | 2011-07-27 | Paper |
On the amount of nonconstructivity in learning recursive functions
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Untestable Properties in the Kahr-Moore-Wang Class
Logic, Language, Information and Computation | 2011-05-27 | Paper |
Recent Experiences in Parameter-Free Data Mining
Lecture Notes in Electrical Engineering | 2010-10-06 | Paper |
A note on the testability of Ramsey's class
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Untestable Properties Expressible with Four First-Order Quantifiers
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Clustering the normalized compression distance for influenza virus data
Algorithms and Applications | 2010-05-04 | Paper |
Learning by erasing
Lecture Notes in Computer Science | 2010-04-27 | Paper |
Can learning in the limit be done efficiently?
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Learning a subclass of regular patterns in polynomial time
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Relational Properties Expressible with One Universal Quantifier Are Testable
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
Recent Developments in Algorithmic Teaching
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Consistent and coherent learning with \(\delta \)-delay
Information and Computation | 2008-12-03 | Paper |
Teaching Memoryless Randomized Learners Without Feedback
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science | 2008-05-28 | Paper |
Learning recursive functions: A survey
Theoretical Computer Science | 2008-05-28 | Paper |
Indistinguishability and First-Order Logic
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Teaching Randomized Learners
Learning Theory | 2007-09-14 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science | 2007-01-09 | Paper |
From learning in the limit to stochastic finite learning
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Inductive inference of approximations for recursive concepts
Theoretical Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2083808 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080443 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080664 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080643 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077144 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2077178 (Why is no real title available?) | 2004-07-01 | Paper |
On learning of functions refutably.
Theoretical Computer Science | 2003-05-22 | Paper |
Learning classes of approximations to non-recursive functions.
Theoretical Computer Science | 2003-01-21 | Paper |
Incremental concept learning for bounded data mining.
Information and Computation | 2003-01-14 | Paper |
Stochastic finite learning of the pattern languages
Machine Learning | 2001-10-14 | Paper |
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1453045 (Why is no real title available?) | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1511697 (Why is no real title available?) | 2000-09-27 | Paper |
Learning languages and functions by erasing
Theoretical Computer Science | 2000-08-21 | Paper |
An average-case optimal one-variable pattern language learner
Journal of Computer and System Sciences | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1404232 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1379106 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1372649 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1372672 (Why is no real title available?) | 1999-12-01 | Paper |
Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
Annals of Mathematics and Artificial Intelligence | 1999-03-23 | Paper |
Classifying Predicates and Languages
International Journal of Foundations of Computer Science | 1997-06-16 | Paper |
Monotonic and dual monotonic language learning
Theoretical Computer Science | 1997-02-27 | Paper |
Set-driven and rearrangement-independent learning of recursive languages
Mathematical Systems Theory | 1996-12-01 | Paper |
Incremental learning from positive data
Journal of Computer and System Sciences | 1996-11-27 | Paper |
Characterizations of monotonic and dual monotonic language learning
Information and Computation | 1996-04-16 | Paper |
| scientific article; zbMATH DE number 791076 (Why is no real title available?) | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 762059 (Why is no real title available?) | 1995-07-05 | Paper |
LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
International Journal of Foundations of Computer Science | 1994-12-18 | Paper |
| scientific article; zbMATH DE number 512873 (Why is no real title available?) | 1994-10-19 | Paper |
Ignoring data may be the only way to learn efficiently
Journal of Experimental & Theoretical Artificial Intelligence | 1994-05-03 | Paper |
Characterization of language learning front informant under various monotonicity constraints
Journal of Experimental & Theoretical Artificial Intelligence | 1994-05-03 | Paper |
| scientific article; zbMATH DE number 517034 (Why is no real title available?) | 1994-04-17 | Paper |
| scientific article; zbMATH DE number 408780 (Why is no real title available?) | 1993-09-06 | Paper |
Highly parallel computations modulo a number having only small prime factors
Information and Computation | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18647 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17545 (Why is no real title available?) | 1992-06-26 | Paper |
One-sided error probabilistic inductive inference and reliable frequency identification
Information and Computation | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4128395 (Why is no real title available?) | 1989-01-01 | Paper |
On the power of recursive optimizers
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4055080 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3960974 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3952736 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3900732 (Why is no real title available?) | 1984-01-01 | Paper |
ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
Mathematical Logic Quarterly | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3861134 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3868611 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858406 (Why is no real title available?) | 1983-01-01 | Paper |
