scientific article; zbMATH DE number 1301791

MaRDI QIDQ4247007zbMATH OpenFDO

Authors Tom Head, Takashi Yokomori, Satoshi Kobayashi

Publication date 16 June 1999

zbMATH Keywords

algorithmic learning

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Learning approximately regular languages with reversible languages
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• scientific article; zbMATH DE number 2019595

Cited in

(17)

• scientific article; zbMATH DE number 2019595 (Why is no real title available?)
• Automatic learning of subclasses of pattern languages
• scientific article; zbMATH DE number 2150298 (Why is no real title available?)
• scientific article; zbMATH DE number 4001459 (Why is no real title available?)
• INFERENCE OF REVERSIBLE LANGUAGES
• Efficient learning of tier-based strictly \(k\)-local languages
• scientific article; zbMATH DE number 1670720 (Why is no real title available?)
• Minimal concept identification and reliability
• Learning regular languages from simple positive examples
• Some sufficient conditions of learnability in the limit from positive data
• A hierarchy of language families learnable by regular language learning
• Algorithmic Learning Theory
• Learnability and positive equivalence relations
• scientific article; zbMATH DE number 2019607 (Why is no real title available?)
• Learnability of automatic classes
• Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
• Automatic learners with feedback queries

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