Learning Regular Sets from Queries and Counterexamples

Keywords

Counterexample, Computer science, Theoretical computer science, Artificial intelligence, Discrete mathematics

References

• Algorithmic Program DebuggingEhud Shapiro — 1983
• System identification via state characterizationEric Gold — 1972
• Complexity of Automaton Identification from Given DataEric Gold — 1978
• A theory of the learnableLeslie G. Valiant — 1984
• Inductive Inference: Theory and MethodsDana Angluin, Carl H. Smith — 1983
• A Note on the Number of Queries Needed to Identify Regular LanguagesDana Angluin — 1981
• Complete problems for deterministic polynomial timeNeil D. Jones, William T. Laaser — 1974
• Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimensionAnselm Blumer, Andrzej Ehrenfeucht, David Haussler — 1986
• Complete problems for deterministic polynomial timeNeil D. Jones, William T. Laaser — 1976

Cited by

• Synthesis and compositional verification using language learningRajeev Alur, Wonhong Nam — 2007
• Integrating gene expression signals with bounded collection grammarsJonathan Schug, Max Mintz, Christian J. Stoeckert — 2005
• Active data selection in supervised and unsupervised learningMartina Hasenjäger — 2000
• Inference and Abstraction of Communication ProtocolsFides Aarts — 2009
• Quantifying the Inductive Bias in Concept Learning (Extended Abstract)David Haussler — 1986
• Learning Regular Tree Languages from Correction and Equivalence QueriesCătălin Ionuţ Tîrnăucă, Cristina Tîrnȃucȃ — 2007
• Machine learning in health informatics: making better use of domain expertsCarla E. Brodley, Byron Wallace — 2012
• On the Learnability of the UncomputableRichard H. Lathrop — 1996
• Phase Transitions of Bounded Satisfiability ProblemsDelbert D. Bailey, Phokion G. Kolaitis — 2003
• Let’s Look at the Logs: Low-Impact Runtime Verification∗Alex Groce, Klaus Havelund, Margaret Smith — 2009
• Approximation Algorithms and New Models for Clustering and LearningPranjal Awasthi — 2013
• Leveraging Lexical Semantics to Infer Context-Free GrammarsTim Oates, Tom Armstrong, Justin Harris — 2003
• On the Relationship between Lexical Semantics and Syntax for the Inference of Context-Free GrammarsTim Oates, Tom Armstrong, Justin Harris — 2004
• INFERENCE OF GENETIC REGULATORY NETWORKS UNDER THE BEST-FIT EXTENSION PARADIGMIlya Shmulevich, Olli Yli‐Harja, Jaakko Astola — 2001
• MACE: Model-inference-Assisted Concolic Exploration for Protocol and Vulnerability DiscoveryChia Yuan Cho, Domagoj Babić, Pongsin Poosankam — 2011
• Selective Sampling In Natural Language LearningIdo Dagan, Sean P. Engelson — 1995
• The Equivalence and Learning of Probabilistic Automata (Extended Abstract)Wen-Guey Tzeng — 1989
• Practical MAT learning of natural languages using treebanksPetter Ericsson — 2012
• Rigorous examination of reactive systemsFalk Howar, Malte Isberner, Maik Merten — 2014
• Teaching Software Modeling and Design Based on The Science of Design and Science of LearningSukhamay Kundu — 2008

Related papers

• DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATIONNor Hanim Mustafa, Dinmukhamed Kelesbayev, Zh.D. Alibekova — 2018
• The construction of a counterexampleXi-Qiang Liu — 2011
• An Efficient Algorithm to Understand Long CounterexampleZhi Yuan Chen, Shao Bin Huang, Ming Ji — 2013
• Knowing Is Not EnoughMartin Montminy — 2017
• Uniqueness and Logical DisagreementFrederik J. Andersen — 2020
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderingsRichard Watnick — 1984