scientific article; zbMATH DE number 1301791

zbMATH Open0932.68057MaRDI QIDQ4247007FDOQ4247007

Authors: Tom Head, Takashi Yokomori, Satoshi Kobayashi 

Publication date: 16 June 1999

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

algorithmic learning

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (17)

• Automatic learning of subclasses of pattern languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• INFERENCE OF REVERSIBLE LANGUAGES
• Efficient learning of tier-based strictly \(k\)-local languages
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Learnability of automatic classes
• Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
• Automatic learners with feedback queries
• Title not available (Why is that?)

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)