| Publication | Date of Publication | Type |
|---|
| Representing regular languages of infinite words using mod 2 multiplicity automata | 2024-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874193 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384896 | 2021-12-17 | Paper |
| Polynomial Identification of $$\omega $$-Automata | 2021-11-10 | Paper |
| Queries and concept learning | 2021-10-04 | Paper |
| Regular \(\omega\)-languages with an informative right congruence | 2021-06-03 | Paper |
| Query Learning of Derived Omega-Tree Languages in Polynomial Time | 2020-05-26 | Paper |
| The power of random counterexamples | 2020-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232903 | 2019-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645661 | 2019-01-10 | Paper |
| Families of DFAs as Acceptors of omega-Regular Languages | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4603446 | 2018-02-20 | Paper |
| Learning a Random DFA from Uniform Strings and State Information | 2016-11-30 | Paper |
| A model of language learning with semantics and meaning-preserving corrections | 2016-11-29 | Paper |
| Learning regular omega languages | 2016-10-21 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2015-08-03 | Paper |
| Stably computable predicates are semilinear | 2015-03-10 | Paper |
| Network construction with subgraph connectivity constraints | 2015-02-16 | Paper |
| Learning Regular Omega Languages | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2933851 | 2014-12-08 | Paper |
| Learning a circuit by injecting values | 2014-11-25 | Paper |
| Effective storage capacity of labeled graphs | 2014-02-11 | Paper |
| Mutation systems | 2013-10-22 | Paper |
| A simple population protocol for fast robust approximate majority | 2013-07-04 | Paper |
| Fast computation by population protocols with a leader | 2013-06-28 | Paper |
| The computational power of population protocols | 2013-06-20 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2013-06-13 | Paper |
| On the Learnability of Shuffle Ideals | 2012-10-16 | Paper |
| Learning acyclic probabilistic circuits using test paths | 2012-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174038 | 2011-10-12 | Paper |
| Mutation Systems | 2011-06-03 | Paper |
| Inferring Social Networks from Outbreaks | 2010-10-01 | Paper |
| Lower Bounds on Learning Random Structures with Statistical Queries | 2010-10-01 | Paper |
| Optimally learning social networks with activations and suppressions | 2010-07-07 | Paper |
| The VC dimension of \(k\)-fold union | 2010-01-29 | Paper |
| Learning Finite Automata Using Label Queries | 2009-12-01 | Paper |
| Learning large-alphabet and analog circuits with value injection queries | 2009-03-31 | Paper |
| Learning a circuit by injecting values | 2009-01-09 | Paper |
| Learning Meaning Before Syntax | 2008-10-16 | Paper |
| Optimally Learning Social Networks with Activations and Suppressions | 2008-10-14 | Paper |
| Fast Computation by Population Protocols with a Leader | 2008-09-09 | Paper |
| A Simple Population Protocol for Fast Robust Approximate Majority | 2008-09-02 | Paper |
| Learning a hidden graph using \(O(\log n)\)queries per edge | 2008-06-10 | Paper |
| Learning Large-Alphabet and Analog Circuits with Value Injection Queries | 2008-01-03 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736016 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473537 | 2004-08-04 | Paper |
| Queries revisited. | 2004-03-14 | Paper |
| Learning from different teachers | 2003-06-25 | Paper |
| Robot localization in a grid | 2002-07-14 | Paper |
| Robot Navigation with Distance Queries | 2000-10-18 | Paper |
| Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle | 2000-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228502 | 1999-11-08 | Paper |
| Malicious omissions and errors in answers to membership queries | 1997-10-07 | Paper |
| When won't membership queries help? | 1995-12-13 | Paper |
| Learning read-once formulas with queries | 1993-05-16 | Paper |
| Learning conjunctions of Horn clauses | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013533 | 1992-09-27 | Paper |
| Training sequences | 1989-01-01 | Paper |
| Learning regular sets from queries and counterexamples | 1987-01-01 | Paper |
| Regular prefix relations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739848 | 1983-01-01 | Paper |
| Inference of Reversible Languages | 1982-01-01 | Paper |
| Two notions of correctness and their relation to testing | 1982-01-01 | Paper |
| A note on the number of queries needed to identify regular languages | 1981-01-01 | Paper |
| Inductive inference of formal languages from positive data | 1980-01-01 | Paper |
| Finding patterns common to a set of strings | 1980-01-01 | Paper |
| On counting problems and the polynomial-time hierarchy | 1980-01-01 | Paper |
| On relativizing auxiliary pushdown machines | 1980-01-01 | Paper |
| Fast probabilistic algorithms for Hamiltonian circuits and matchings | 1979-01-01 | Paper |
| A note on a construction of Margulis | 1979-01-01 | Paper |
| On the complexity of minimum inference of regular sets | 1978-01-01 | Paper |
