Dana Angluin

ORCID

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 26

Top Venues

CoRR

ALT

Trans. Assoc. Comput. Linguistics

Theor. Comput. Sci.

Publications

Lena Strobl, William Merrill, Gail Weiss, David Chiang, Dana Angluin
What Formal Languages Can Transformers Express? A Survey. Trans. Assoc. Comput. Linguistics 12 (2024)
Lena Strobl, Dana Angluin, David Chiang, Jonathan Rawski, Ashish Sabharwal
Transformers as Transducers. CoRR (2024)
Dana Angluin, David Chiang, Andy Yang
Masked Hard-Attention Transformers and Boolean RASP Recognize Exactly the Star-Free Languages. CoRR (2023)
Dana Angluin
Learning of Regular Languages by Recurrent Neural Networks? (Mainly Questions). ICGI (2023)
Lena Strobl, William Merrill, Gail Weiss, David Chiang, Dana Angluin
Transformers as Recognizers of Formal Languages: A Survey on Expressivity. CoRR (2023)
Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS (2022)
Yiding Hao, Dana Angluin, Robert Frank
Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity. Trans. Assoc. Comput. Linguistics 10 (2022)
Yiding Hao, Dana Angluin, Robert Frank
Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity. CoRR (2022)
Dana Angluin, Dana Fisman, Yaara Shoval
Polynomial Identification of omega-Automata. CoRR (2022)
Dana Angluin, Dana Fisman
-languages with an informative right congruence. Inf. Comput. 278 (2021)
Dana Angluin, Dana Fisman, Yaara Shoval
Polynomial Identification of ømega-Automata. TACAS (2) (2020)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL (2020)
Dana Angluin, Tyler Dohrn
The power of random counterexamples. Theor. Comput. Sci. 808 (2020)
Dana Angluin, Dana Fisman
Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors. CoRR (2020)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query learning of derived ωω\omega-tree languages in polynomial time. Log. Methods Comput. Sci. 15 (3) (2019)
Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn
Context-Free Transductions with Neural Stacks. BlackboxNLP@EMNLP (2018)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. 14 (1) (2018)
Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn
Context-Free Transductions with Neural Stacks. CoRR (2018)
Dana Angluin, Dana Fisman
Regular omega-Languages with an Informative Right Congruence. GandALF (2018)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query learning of derived ω-tree languages in polynomial time. CoRR (2018)
Dana Angluin, Tyler Dohrn
The Power of Random Counterexamples. ALT (2017)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query Learning of Derived Omega-Tree Languages in Polynomial Time. CSL (2017)
Dana Angluin, Leonor Becerra-Bonache
A model of language learning with semantics and meaning-preserving corrections. Artif. Intell. 242 (2017)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR (2016)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of omega-Regular Languages. MFCS (2016)
Dana Angluin, Dana Fisman
Learning regular omega languages. Theor. Comput. Sci. 650 (2016)
Dana Angluin, Dongqu Chen
Learning a Random DFA from Uniform Strings and State Information. ALT (2015)
Dana Angluin, Sarah Eisenstat, Dana Fisman
Learning Regular Languages via Alternating Automata. IJCAI (2015)
Dana Angluin, James Aspnes, Lev Reyzin
Network construction with subgraph connectivity constraints. J. Comb. Optim. 29 (2) (2015)
Dana Angluin, Dana Fisman
Learning Regular Omega Languages. ALT (2014)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Effective storage capacity of labeled graphs. Inf. Comput. 234 (2014)
Dana Angluin, James Aspnes, Raonne Barbosa Vargas
Mutation systems. Int. J. Comput. Math. 90 (6) (2013)
Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz
Learning and verifying quantified boolean queries by example. PODS (2013)
Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
On the learnability of shuffle ideals. J. Mach. Learn. Res. 14 (1) (2013)
Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz
Learning and Verifying Quantified Boolean Queries by Example CoRR (2013)
Dana Angluin, James Aspnes, Aryeh Kontorovich
On the Learnability of Shuffle Ideals. ALT (2012)
Dana Angluin, Leonor Becerra-Bonache
Effects of Meaning-Preserving Corrections on Language Learning. CoNLL (2011)
Dana Angluin, Leonor Becerra-Bonache
An Overview of How Semantics and Corrections Can Help Language Learning. Web Intelligence/IAT Workshops (2011)
Dana Angluin, James Aspnes, Raonne Barbosa Vargas
Mutation Systems. LATA (2011)
Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin
Lower Bounds on Learning Random Structures with Statistical Queries. ALT (2010)
Dana Angluin, James Aspnes, Lev Reyzin
Inferring Social Networks from Outbreaks. ALT (2010)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Storage Capacity of Labeled Graphs. SSS (2010)
Dana Angluin, James Aspnes, Lev Reyzin
Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411 (29-30) (2010)
Dana Angluin, Leonor Becerra-Bonache, Adrian-Horia Dediu, Lev Reyzin
Learning Finite Automata Using Label Queries. ALT (2009)
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
Learning a circuit by injecting values. J. Comput. Syst. Sci. 75 (1) (2009)
Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 10 (2009)
Dana Angluin, Jiang Chen
Learning a hidden graph using O(logn) queries per edge. J. Comput. Syst. Sci. 74 (4) (2008)
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3 (4) (2008)
Dana Angluin, James Aspnes, David Eisenstat
Fast computation by population protocols with a leader. Distributed Comput. 21 (3) (2008)
Dana Angluin, James Aspnes, Lev Reyzin
Optimally Learning Social Networks with Activations and Suppressions. ALT (2008)
Dana Angluin, Leonor Becerra-Bonache
Learning Meaning Before Syntax. ICGI (2008)
Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
Learning Acyclic Probabilistic Circuits Using Test Paths. COLT (2008)
Dana Angluin, James Aspnes, David Eisenstat
A simple population protocol for fast robust approximate majority. Distributed Comput. 21 (2) (2008)
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
Learning large-alphabet and analog circuits with value injection queries. Mach. Learn. 72 (1-2) (2008)
Dana Angluin, James Aspnes, David Eisenstat
A Simple Population Protocol for Fast Robust Approximate Majority. DISC (2007)
David Eisenstat, Dana Angluin
The VC dimension of k-fold union. Inf. Process. Lett. 101 (5) (2007)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols. Distributed Comput. 20 (4) (2007)
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT (2007)
Dana Angluin, Michael J. Fischer, Hong Jiang
Stabilizing Consensus in Mobile Networks. DCOSS (2006)
Dana Angluin, James Aspnes, David Eisenstat
Fast Computation by Population Protocols with a Leader. DISC (2006)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols CoRR (2006)
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
Learning a circuit by injecting values. STOC (2006)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18 (4) (2006)
Dana Angluin, Jiang Chen
Learning a Hidden Hypergraph. J. Mach. Learn. Res. 7 (2006)
Dana Angluin, James Aspnes, David Eisenstat
Stably computable predicates are semilinear. PODC (2006)
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Self-stabilizing Population Protocols. OPODIS (2005)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
On the Power of Anonymous One-Way Communication. OPODIS (2005)
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin
Fast construction of overlay networks. SPAA (2005)
Dana Angluin, Jiang Chen
Learning a Hidden Hypergraph. COLT (2005)
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
Stably Computable Properties of Network Graphs. DCOSS (2005)
Dana Angluin, Jiang Chen
Learning a Hidden Graph Using O(log n) Queries Per Edge. COLT (2004)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. PODC (2004)
Dana Angluin
Queries revisited. Theor. Comput. Sci. 313 (2) (2004)
Dana Angluin
Learning and Mathematics. ICGI (2004)
Dana Angluin, Martins Krikis
Learning from Different Teachers. Mach. Learn. 51 (2) (2003)
Dana Angluin
Queries Revisited. Discovery Science (2001)
Chinda Wongngamnit, Dana Angluin
Robot localization in a grid. Inf. Process. Lett. 77 (5-6) (2001)
Dana Angluin
Queries Revisited. ALT (2001)
Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu
Robot Navigation with Distance Queries. SIAM J. Comput. 30 (1) (2000)
Dana Angluin, Miklós Csürös
Learning Markov Chains with Variable Memory Length from Noisy Output. COLT (1997)
Dana Angluin, Martins Krikis
Teachers, Learners and Black Boxes. COLT (1997)
Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
Malicious Omissions and Errors in Answers to Membership Queries. Mach. Learn. 28 (2-3) (1997)
Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu
Robot Navigation with Range Queries. STOC (1996)
Dana Angluin
A 1996 Snapshot of Computational Learning Theory. ACM Comput. Surv. 28 (4es) (1996)
Dana Angluin, Michael Kharitonov
When Won't Membership Queries Help? J. Comput. Syst. Sci. 50 (2) (1995)
Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. Mach. Learn. 18 (1) (1995)
Dana Angluin, Martins Krikis
Learning with Malicious Membership Queries and Exceptions (Extended Abstract). COLT (1994)
Dana Angluin, Donna K. Slonim
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle. Mach. Learn. 14 (1) (1994)
Dana Angluin, Lisa Hellerstein, Marek Karpinski
Learning Read-Once Formulas with Queries. J. ACM 40 (1) (1993)
Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. AAAI (1992)
Dana Angluin
Computational Learning Theory: Survey and Selected Bibliography STOC (1992)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses. Mach. Learn. 9 (1992)
Dana Angluin, Donna K. Slonim
Learning Monotone DNF with an Incomplete Membership Oracle. COLT (1991)
Dana Angluin, Michael Kharitonov
When Won't Membership Queries Help? (Extended Abstract) STOC (1991)
Dana Angluin
Negative Results for Equivalence Queries. Mach. Learn. 5 (1990)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses (Abstract). COLT (1990)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses (Extended Abstract) FOCS (1990)
Dana Angluin
Equivalence Queries and Approximate Fingerprints. COLT (1989)
Dana Angluin, William I. Gasarch, Carl H. Smith
Training Sequences. Theor. Comput. Sci. 66 (3) (1989)
Dana Angluin
Learning With Hints. COLT (1988)

Dana Angluin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dana Angluin