Dana Angluin

From MaRDI portal
Person:329609

Available identifiers

zbMath Open angluin.danaMaRDI QIDQ329609

List of research outcomes

PublicationDate of PublicationType
Representing regular languages of infinite words using mod 2 multiplicity automata2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q58741932023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q33848962021-12-17Paper
Polynomial Identification of $$\omega $$-Automata2021-11-10Paper
Queries and concept learning2021-10-04Paper
Regular \(\omega\)-languages with an informative right congruence2021-06-03Paper
https://portal.mardi4nfdi.de/entity/Q51111772020-05-26Paper
The power of random counterexamples2020-01-29Paper
https://portal.mardi4nfdi.de/entity/Q52329032019-09-13Paper
https://portal.mardi4nfdi.de/entity/Q46456612019-01-10Paper
https://portal.mardi4nfdi.de/entity/Q46085692018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46034462018-02-20Paper
Learning a Random DFA from Uniform Strings and State Information2016-11-30Paper
A model of language learning with semantics and meaning-preserving corrections2016-11-29Paper
Learning regular omega languages2016-10-21Paper
Computation in networks of passively mobile finite-state sensors2015-08-03Paper
Stably computable predicates are semilinear2015-03-10Paper
Network construction with subgraph connectivity constraints2015-02-16Paper
Learning Regular Omega Languages2015-01-14Paper
https://portal.mardi4nfdi.de/entity/Q29338512014-12-08Paper
Learning a circuit by injecting values2014-11-25Paper
Effective storage capacity of labeled graphs2014-02-11Paper
Mutation systems2013-10-22Paper
A simple population protocol for fast robust approximate majority2013-07-04Paper
Fast computation by population protocols with a leader2013-06-28Paper
The computational power of population protocols2013-06-20Paper
Computation in networks of passively mobile finite-state sensors2013-06-13Paper
On the Learnability of Shuffle Ideals2012-10-16Paper
https://portal.mardi4nfdi.de/entity/Q28809532012-04-17Paper
https://portal.mardi4nfdi.de/entity/Q31740382011-10-12Paper
Mutation Systems2011-06-03Paper
Inferring Social Networks from Outbreaks2010-10-01Paper
Lower Bounds on Learning Random Structures with Statistical Queries2010-10-01Paper
Optimally learning social networks with activations and suppressions2010-07-07Paper
The VC dimension of \(k\)-fold union2010-01-29Paper
Learning Finite Automata Using Label Queries2009-12-01Paper
Learning large-alphabet and analog circuits with value injection queries2009-03-31Paper
Learning a circuit by injecting values2009-01-09Paper
Learning Meaning Before Syntax2008-10-16Paper
Optimally Learning Social Networks with Activations and Suppressions2008-10-14Paper
Fast Computation by Population Protocols with a Leader2008-09-09Paper
A Simple Population Protocol for Fast Robust Approximate Majority2008-09-02Paper
Learning a hidden graph using \(O(\log n)\)queries per edge2008-06-10Paper
Learning Large-Alphabet and Analog Circuits with Value Injection Queries2008-01-03Paper
Grammatical Inference: Algorithms and Applications2006-10-20Paper
Learning Theory2006-06-22Paper
Learning Theory2005-06-13Paper
https://portal.mardi4nfdi.de/entity/Q47360162004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44735372004-08-04Paper
Queries revisited.2004-03-14Paper
Learning from different teachers2003-06-25Paper
Robot localization in a grid2002-07-14Paper
Robot Navigation with Distance Queries2000-10-18Paper
Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle2000-08-14Paper
https://portal.mardi4nfdi.de/entity/Q42285021999-11-08Paper
Malicious omissions and errors in answers to membership queries1997-10-07Paper
When won't membership queries help?1995-12-13Paper
Learning read-once formulas with queries1993-05-16Paper
Learning conjunctions of Horn clauses1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40135331992-09-27Paper
Training sequences1989-01-01Paper
Learning regular sets from queries and counterexamples1987-01-01Paper
Regular prefix relations1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47398481983-01-01Paper
Two notions of correctness and their relation to testing1982-01-01Paper
Inference of Reversible Languages1982-01-01Paper
A note on the number of queries needed to identify regular languages1981-01-01Paper
Finding patterns common to a set of strings1980-01-01Paper
On counting problems and the polynomial-time hierarchy1980-01-01Paper
On relativizing auxiliary pushdown machines1980-01-01Paper
Inductive inference of formal languages from positive data1980-01-01Paper
Fast probabilistic algorithms for Hamiltonian circuits and matchings1979-01-01Paper
A note on a construction of Margulis1979-01-01Paper
On the complexity of minimum inference of regular sets1978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dana Angluin