Locality, reversibility, and beyond: Learning languages from positive data
From MaRDI portal
Recommendations
Cited in
(20)- Learning approximately regular languages with reversible languages
- Learnability of automatic classes
- Learnability and positive equivalence relations
- A hierarchy of language families learnable by regular language learning
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- Automatic learners with feedback queries
- scientific article; zbMATH DE number 1670720 (Why is no real title available?)
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
- INFERENCE OF REVERSIBLE LANGUAGES
- scientific article; zbMATH DE number 2019595 (Why is no real title available?)
- scientific article; zbMATH DE number 2019607 (Why is no real title available?)
- scientific article; zbMATH DE number 2150298 (Why is no real title available?)
- scientific article; zbMATH DE number 4001459 (Why is no real title available?)
- Minimal concept identification and reliability
- Some sufficient conditions of learnability in the limit from positive data
- Algorithmic Learning Theory
- Efficient learning of tier-based strictly k-local languages
- Learning regular languages from simple positive examples
- Learnability and positive equivalence relations
- Automatic learning of subclasses of pattern languages
This page was built for publication: Locality, reversibility, and beyond: Learning languages from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247007)
