| Publication | Date of Publication | Type |
|---|
| A bisection approach to subcubic maximum induced matching | 2024-07-19 | Paper |
| Learnability and positive equivalence relations | 2024-02-02 | Paper |
| Machine induction without revolutionary paradigm shifts | 2023-12-08 | Paper |
| Alternating automatic register machines | 2023-07-28 | Paper |
| Addition machines, automatic functions and open problems of Floyd and Knuth | 2023-06-12 | Paper |
| Languages given by Finite Automata over the Unary Alphabet | 2023-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875650 | 2023-02-03 | Paper |
| String compression in FA-presentable structures | 2023-02-01 | Paper |
| Lamplighter groups and automata | 2022-08-30 | Paper |
| Random Subgroups of Rationals | 2022-07-21 | Paper |
| A computation model with automatic functions and relations as primitive operations | 2022-06-13 | Paper |
| Deciding Parity Games in Quasi-polynomial Time | 2022-05-03 | Paper |
| Learners based on transducers | 2022-03-14 | Paper |
| On the amount of nonconstructivity in learning formal languages from text | 2021-11-25 | Paper |
| Bi-immunity over different size alphabets | 2021-11-11 | Paper |
| Learnability and positive equivalence relations | 2021-10-04 | Paper |
| Ordered semiautomatic rings with applications to geometry | 2020-07-27 | Paper |
| Searching for shortest and least programs | 2020-01-22 | Paper |
| Exact satisfiabitity with jokers | 2019-10-15 | Paper |
| Reductions between types of numberings | 2019-10-07 | Paper |
| The isomorphism problem for tree-automatic ordinals with addition | 2019-09-20 | Paper |
| Intrinsic complexity of partial learning | 2019-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617615 | 2019-02-06 | Paper |
| The complexity of verbal languages over groups | 2019-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645642 | 2019-01-10 | Paper |
| Finitely generated semiautomatic groups | 2018-09-20 | Paper |
| Learning pattern languages over groups | 2018-08-22 | Paper |
| Learners based on transducers | 2018-06-26 | Paper |
| Effectivity questions for Kleene's recursion theorem | 2018-06-05 | Paper |
| Semiautomatic structures | 2018-02-01 | Paper |
| Regular patterns, regular languages and context-free languages | 2017-11-03 | Paper |
| Enumerations including laconic enumerators | 2017-10-17 | Paper |
| Deciding parity games in quasipolynomial time | 2017-08-17 | Paper |
| Automatic learning from positive data and negative counterexamples | 2017-08-08 | Paper |
| A Survey on Recent Results on Partial Learning | 2017-06-09 | Paper |
| The Complexity of Verbal Languages over Groups | 2017-05-16 | Paper |
| Closed left-r.e. sets | 2017-02-23 | Paper |
| Inductive Inference and Reverse Mathematics | 2017-01-24 | Paper |
| Branch and bound on the network model | 2017-01-19 | Paper |
| Priced Learning | 2016-11-30 | Paper |
| Enlarging learnable classes | 2016-11-18 | Paper |
| Learning Pattern Languages over Groups | 2016-11-09 | Paper |
| Intrinsic Complexity of Partial Learning | 2016-11-09 | Paper |
| Parallel learning of automatic classes of languages | 2016-10-21 | Paper |
| Inductive inference and reverse mathematics | 2016-10-10 | Paper |
| Finitely Generated Semiautomatic Groups | 2016-08-17 | Paper |
| On a question of nearly minimal identification of functions | 2016-06-16 | Paper |
| Tree-automatic scattered linear orders | 2016-03-31 | Paper |
| On the role of update constraints and text-types in iterative learning | 2016-03-10 | Paper |
| Learning Automatic Families of Languages | 2016-03-10 | Paper |
| Effectivity Questions for Kleene’s Recursion Theorem | 2015-12-11 | Paper |
| Learning from Positive Data and Negative Counterexamples: A Survey | 2015-09-08 | Paper |
| Graphs realised by r.e. equivalence relations | 2015-06-17 | Paper |
| MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY | 2015-04-29 | Paper |
| On the Role of Update Constraints and Text-Types in Iterative Learning | 2015-01-14 | Paper |
| Parallel Learning of Automatic Classes of Languages | 2015-01-14 | Paper |
| Semiautomatic Structures | 2014-06-24 | Paper |
| Robust learning of automatic classes of languages | 2014-02-13 | Paper |
| Automatic learners with feedback queries | 2014-02-13 | Paper |
| Learning and classifying | 2014-01-09 | Paper |
| Mind change speed-up for learning languages from positive data | 2013-12-19 | Paper |
| Editors’ Introduction | 2013-11-06 | Paper |
| Automatic functions, linear time and learning | 2013-09-26 | Paper |
| On Conservative Learning of Recursively Enumerable Languages | 2013-08-05 | Paper |
| ON AUTOMATIC FAMILIES | 2013-06-03 | Paper |
| Learning without coding | 2013-03-04 | Paper |
| Automatic learning of subclasses of pattern languages | 2012-11-27 | Paper |
| Learnability of automatic classes | 2012-11-06 | Paper |
| Enlarging Learnable Classes | 2012-10-16 | Paper |
| Automatic Learning from Positive Data and Negative Counterexamples | 2012-10-16 | Paper |
| Mind change speed-up for learning languages from positive data | 2012-08-23 | Paper |
| Learning with ordinal-bounded memory from positive data | 2012-08-17 | Paper |
| Automatic Functions, Linear Time and Learning | 2012-08-14 | Paper |
| On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data | 2012-07-16 | Paper |
| Iterative learning from texts and counterexamples using additional information | 2012-05-08 | Paper |
| Rice and Rice-Shapiro Theorems for transfinite correction grammars | 2011-11-07 | Paper |
| Robust Learning of Automatic Classes of Languages | 2011-10-19 | Paper |
| Learning and Classifying | 2011-10-19 | Paper |
| Automatic Learners with Feedback Queries | 2011-09-09 | Paper |
| Hypothesis spaces for learning | 2011-07-27 | Paper |
| Closed Left-R.E. Sets | 2011-07-01 | Paper |
| Automatic Learning of Subclasses of Pattern Languages | 2011-06-03 | Paper |
| Index sets and universal numberings | 2011-04-28 | Paper |
| Uncountable automatic classes and learning | 2011-04-14 | Paper |
| Inductive Inference of Languages from Samplings | 2010-10-01 | Paper |
| On some open problems in monotonic and conservative learning | 2010-08-20 | Paper |
| Index Sets and Universal Numberings | 2010-07-28 | Paper |
| Iterative learning of simple external contextual languages | 2010-07-07 | Paper |
| Incremental learning with temporary memory | 2010-07-07 | Paper |
| On some open problems in reflective inductive inference | 2010-06-16 | Paper |
| Learnability of Automatic Classes | 2010-05-26 | Paper |
| Numberings optimal for learning | 2010-05-25 | Paper |
| Vacillatory and BC learning on noisy data | 2010-04-27 | Paper |
| On learning and co-learning of minimal programs | 2010-04-27 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Uncountable automatic classes and learning | 2009-12-01 | Paper |
| Iterative Learning from Texts and Counterexamples Using Additional Information | 2009-12-01 | Paper |
| Learning from streams | 2009-12-01 | Paper |
| Input-dependence in function-learning | 2009-10-19 | Paper |
| Mitotic Classes in Inductive Inference | 2009-08-20 | Paper |
| One-shot learners using negative counterexamples and nearest positive examples | 2009-07-10 | Paper |
| Learning correction grammars | 2009-06-04 | Paper |
| Prescribed learning of r.e. classes | 2009-05-12 | Paper |
| Hypothesis Spaces for Learning | 2009-04-02 | Paper |
| Numberings Optimal for Learning | 2008-10-14 | Paper |
| Iterative Learning of Simple External Contextual Languages | 2008-10-14 | Paper |
| Iterative Learning from Positive Data and Negative Counterexamples | 2008-09-04 | Paper |
| Learning and Extending Sublanguages | 2008-09-04 | Paper |
| Towards a Better Understanding of Incremental Learning | 2008-09-04 | Paper |
| Learning in Friedberg numberings | 2008-08-22 | Paper |
| Prescribed Learning of R.E. Classes | 2008-08-19 | Paper |
| Learning in Friedberg Numberings | 2008-08-19 | Paper |
| One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples | 2008-08-19 | Paper |
| Prescribed learning of indexed families | 2008-06-11 | Paper |
| Non-U-shaped vacillatory and team learning | 2008-06-10 | Paper |
| Learning languages from positive data and negative counterexamples | 2008-06-10 | Paper |
| Learning and extending sublanguages | 2008-05-28 | Paper |
| Absolute versus probabilistic classification in a logical setting | 2008-05-28 | Paper |
| Learning languages from positive data and a limited number of short counterexamples | 2008-01-07 | Paper |
| Learning Correction Grammars | 2008-01-03 | Paper |
| Mitotic Classes | 2008-01-03 | Paper |
| A general comparison of language learning from examples and from queries | 2007-12-19 | Paper |
| Learning multiple languages in groups | 2007-12-19 | Paper |
| Iterative learning from positive data and negative counterexamples | 2007-12-10 | Paper |
| Some natural conditions on incremental learning | 2007-11-21 | Paper |
| Input-Dependence in Function-Learning | 2007-11-13 | Paper |
| Results on memory-limited U-shaped learning | 2007-10-10 | Paper |
| Invertible classes | 2007-09-28 | Paper |
| On Learning Languages from Positive Data and a Limited Number of Short Counterexamples | 2007-09-14 | Paper |
| Memory-Limited U-Shaped Learning | 2007-09-14 | Paper |
| Negative data in learning languages | 2007-05-02 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Learning languages in a union | 2007-01-22 | Paper |
| Learning a subclass of regular patterns in polynomial time | 2007-01-09 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| Variations on U-shaped learning | 2006-08-17 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Identifying Clusters from Positive Data | 2006-06-01 | Paper |
| Generality's price: Inescapable deficiencies in machine-learned programs | 2006-04-28 | Paper |
| Learning languages from positive data and a finite number of queries | 2006-04-28 | Paper |
| On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms | 2005-10-10 | Paper |
| Parsimony hierarchies for inductive inference | 2005-08-29 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Counting extensional differences in BC-learning | 2004-11-23 | Paper |
| Robust learning -- rich and poor | 2004-10-01 | Paper |
| Intrinsic complexity of learning geometrical concepts from positive data | 2004-08-19 | Paper |
| Learning all subfunctions of a function | 2004-08-10 | Paper |
| Classes with easily learnable subclasses | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473555 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473557 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473556 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473560 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470563 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470564 | 2004-07-01 | Paper |
| Learning by switching type of information. | 2004-03-14 | Paper |
| Learning how to separate. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453928 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420752 | 2003-08-18 | Paper |
| On the intrinsic complexity of learning recursive functions | 2003-07-29 | Paper |
| On learning of functions refutably. | 2003-05-22 | Paper |
| Incremental concept learning for bounded data mining. | 2003-01-14 | Paper |
| The synthesis of language learners. | 2003-01-14 | Paper |
| Robust behaviorally correct learning. | 2003-01-14 | Paper |
| On a generalized notion of mistake bounds | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148803 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148805 | 2002-09-22 | Paper |
| Mind change complexity of learning logic programs | 2002-07-15 | Paper |
| Language learning from texts: Degrees of intrinsic complexity and their characterizations | 2002-07-04 | Paper |
| Predictive learning models for concept drift | 2002-03-03 | Paper |
| Control structures in hypothesis spaces: The influence on learning | 2002-03-03 | Paper |
| Some independence results for control structures in complete numberings | 2002-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757852 | 2001-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757848 | 2001-12-04 | Paper |
| Robust learning is rich | 2001-09-09 | Paper |
| Synthesizing learners tolerating computable noisy data | 2001-09-09 | Paper |
| On the learnability of recursively enumerable languages from good examples | 2001-08-20 | Paper |
| Branch and bound on the network model | 2001-08-20 | Paper |
| Synthesizing noise-tolerant language learners | 2001-08-20 | Paper |
| Costs of general purpose learning | 2001-08-20 | Paper |
| On an open problem in classification of languages | 2001-01-01 | Paper |
| Team learning of computable languages | 2000-09-05 | Paper |
| Ordinal mind change complexity of language identification | 2000-08-23 | Paper |
| Learning languages and functions by erasing | 2000-08-21 | Paper |
| Vacillatory and BC learning on noisy data | 2000-08-21 | Paper |
| Robust learning aided by context | 2000-07-24 | Paper |
| Prudence in vacillatory language identification | 2000-07-06 | Paper |
| Program size restrictions in computational learning | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247012 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247013 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247008 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267833 | 1999-10-20 | Paper |
| Learning with refutation | 1999-02-21 | Paper |
| Generalization and specialization strategies for learning r. e. languages | 1999-01-06 | Paper |
| The structure of intrinsic complexity of learning | 1998-09-02 | Paper |
| Kolmogorov numberings and minimal identification | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370215 | 1998-05-25 | Paper |
| Learning from Multiple Sources of Inaccurate Data | 1998-02-10 | Paper |
| Computational limits on team identification of languages | 1997-10-13 | Paper |
| On aggregating teams of learning machines | 1997-09-29 | Paper |
| Characterizing language identification in terms of computable numberings | 1997-06-11 | Paper |
| Program synthesis in the presence of infinite number of inaccuracies | 1997-03-18 | Paper |
| Elementary formal systems, intrinsic complexity, and procrastination | 1997-03-06 | Paper |
| On a question about learning nearly minimal programs | 1997-02-28 | Paper |
| Learning in the presence of inaccurate information | 1997-02-27 | Paper |
| Anomalous learning helps succinctness | 1997-02-27 | Paper |
| Machine induction without revolutionary changes in hypothesis size | 1997-02-03 | Paper |
| The intrinsic complexity of language identification | 1996-11-26 | Paper |
| AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS | 1995-12-03 | Paper |
| Language learning with some negative information | 1995-10-25 | Paper |
| Finite identification of functions by teams with success ratio \(\frac 12\) and above | 1995-10-10 | Paper |
| Complexity issues for vacillatory function identification | 1995-05-28 | Paper |
| Approximate inference and scientific method | 1995-01-11 | Paper |
| Characterizing language identification by standardizing operations | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4300060 | 1994-09-08 | Paper |
| Machine learning of higher-order programs | 1994-08-15 | Paper |
| Extremes in the degrees of inferability | 1994-05-03 | Paper |
| BANISHING ROBUST TURING COMPLETENESS | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281569 | 1994-03-10 | Paper |
| On the non-existence of maximal inference degrees for language identification | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038689 | 1993-05-18 | Paper |
| Learning with the knowledge of an upper bound on program size | 1993-05-16 | Paper |
| ON LEARNING LIMITING PROGRAMS | 1993-01-16 | Paper |
| ON THE LIMITATIONS OF LOCALLY ROBUST POSITIVE REDUCTIONS | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013537 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013536 | 1992-09-27 | Paper |
| Learning in the presence of partial explanations | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3356300 | 1989-01-01 | Paper |
