On Learning Regular Expressions and Patterns Via Membership and Correction Queries

DOI10.1007/978-3-540-88009-7_10zbMath1177.68118OpenAlexW1568294605MaRDI QIDQ3528413

E. B. Kinber

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_10

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

A model of language learning with semantics and meaning-preserving corrections, A Note on the Relationship between Different Types of Correction Queries, Algorithms for learning regular expressions from positive data, Necessary and sufficient conditions for learning with correction queries

Cites Work

• Unnamed Item
• Polynomial-time inference of arbitrary pattern languages
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Queries and concept learning
• Learning DFA from Correction and Equivalence Queries
• A theory of the learnable
• Inference of Reversible Languages
• Algorithmic Learning Theory
• Language identification in the limit