Some classes of regular languages identifiable in the limit from positive data
From MaRDI portal
Recommendations
- Learning approximately regular languages with reversible languages
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
- Identifiability of subspaces and homomorphic images of zero-reversible languages
- scientific article; zbMATH DE number 2080444
- Locality, reversibility, and beyond: Learning languages from positive data
Cited in
(16)- Learning approximately regular languages with reversible languages
- Identification of function distinguishable languages.
- Learning regular languages using RFSAs.
- Learnability of automatic classes
- Learning probabilistic automata using residuals
- Identification of birfsa languages.
- Automatic learners with feedback queries
- Iterated transductions and efficient learning from positive data: A unifying view
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
- Learning Left-to-Right and Right-to-Left Iterative Languages
- String extension learning using lattices
- INFERENCE OF REVERSIBLE LANGUAGES
- Inferring regular languages by merging nonterminals
- Locality, reversibility, and beyond: Learning languages from positive data
- Identifiability of subspaces and homomorphic images of zero-reversible languages
- scientific article; zbMATH DE number 2080444 (Why is no real title available?)
This page was built for publication: Some classes of regular languages identifiable in the limit from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440387)
