Language learning from membership queries and characteristic examples

DOI10.1007/3-540-60454-5_28MaRDI QIDQ6061885zbMATH OpenOpenAlexFDO

Authors Hiroshi Sakamoto

Publication date 8 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60454-5_28

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1670730
• Characteristic sets for polynomial grammatical inference
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 2077176

Cites work

• A characterization of parenthesis languages
• A note on the number of queries needed to identify regular languages
• Grammatical inference for even linear languages based on control sets
• scientific article; zbMATH DE number 3947593 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Parenthesis Grammars
• Queries and concept learning

Cited in

(2)

• Learning tree languages from positive examples and membership queries
• A general comparison of language learning from examples and from queries

This page was built for publication: Language learning from membership queries and characteristic examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061885)