scientific article; zbMATH DE number 1966625

MaRDI QIDQ4420758zbMATH OpenFDO

Authors Daniel Reidenbach

Publication date 18 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2533/25330308.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Inductive inference of unbounded unions of pattern languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• scientific article; zbMATH DE number 996380
• scientific article; zbMATH DE number 996381
• scientific article; zbMATH DE number 791077
• scientific article; zbMATH DE number 3868655
• scientific article; zbMATH DE number 176928
• Polynomial-time inference of arbitrary pattern languages
• scientific article; zbMATH DE number 975708

Cited in

(11)

• Learning erasing pattern languages with queries
• Relations between Gold-style learning and query learning
• STACS 2004
• The study of learnability of the class of k-acceptable languages on Gold's learning model
• Language learnability in the limit: a generalization of Gold's theorem
• A non-learnable class of E-pattern languages
• Learning of erasing primitive formal systems from positive examples
• Learning a subclass of regular patterns in polynomial time
• Developments from enquiries into the learnability of the pattern languages from positive data
• Discontinuities in pattern inference
• Learning indexed families of recursive languages from positive data: A survey

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 Q4420758)