Learning regular sets from queries and counterexamples

1987/11/01 by Dana Angluin · 20 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Artificial intelligence #Computer science #Counterexample #Discrete mathematics #Machine Learning and Algorithms #Mathematics #Theoretical computer science #semigroups and automata theory

paper · doi:10.1016/0890-5401(87)90052-6

crossref issued 1987/11/01 · crossref published 1987/11/01 · crossref published-print 1987/11/01 · openalex publication_date 1987/11/01 · crossref created 2004/12/01 · crossref deposited 2025/09/10 · openalex created_date 2025/10/10 · crossref indexed 2026/08/03 · openalex updated_date 2026/08/04

Citations

• A theory of the learnable

Cited by

• PAC learning PDFA from data streams
• A simple algorithmic framework for disambiguation of finite automata
• Learning Unions of Intersecting Affine Modules in One Dimension with Queries
• Minimality of Random Moore Automata under Prefix-Dependent Congruences
• Learning Alternating Real-Time Automata
• Visibly Recursive Automata
• Passive Learning of Symbolic Automata over Monotonic Algebras
• Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
• An L^# Based Algorithm for Active Learning of Minimal Separating Automata
• Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
• Minimization of Streaming Transducers
• SMT-Based Active Learning of Weighted Automata
• Learning Tree Automata with Term Rewriting
• A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
• Exact Learning of Lightweight Description Logic Ontologies
• Learning Weighted Automata over Number Rings, Concretely and Categorically
• Efficient Induction of Finite State Automata
• Active Learning of Symbolic NetKAT Automata
• Induction and Exploitation of Subgoal Automata for Reinforcement Learning
• Grammar induction [wikipedia]