scientific article; zbMATH DE number 67608

MaRDI QIDQ4013524zbMATH OpenFDO

Authors Naoki Abe

Publication date 27 September 1992

zbMATH Keywords

distribution-free learning model of ValiantParikh- imagesregular setssemilinear sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Characterizing PAC-learnability of semilinear sets
• Learning regular sets from queries and counterexamples
• Learning semilinear sets from examples and via queries
• scientific article; zbMATH DE number 996385
• On the teaching complexity of linear sets

Cited in

(9)

• On the necessity of Occam algorithms
• Learning semilinear sets from examples and via queries
• A polynomial-time algorithm for learning noisy linear threshold functions
• Characterizing PAC-learnability of semilinear sets
• On the teaching complexity of linear sets
• On the Teaching Complexity of Linear Sets
• scientific article; zbMATH DE number 1453041 (Why is no real title available?)
• Polynomial Learning of Distribution Families
• Learning commutative deterministic finite state automata in polynomial time

This page was built for publication:

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