Automatic Learners with Feedback Queries
From MaRDI portal
Recommendations
Cites work
- Automata Presenting Structures: A Survey of the Finite String Case
- Automatic learning of subclasses of pattern languages
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 3841819 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- Identification of function distinguishable languages.
- Incremental concept learning for bounded data mining.
- Incremental learning from positive data
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Language identification in the limit
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Learnability of automatic classes
- Learning indexed families of recursive languages from positive data: A survey
- Learning regular sets from queries and counterexamples
- On automatic families
- On the impact of forgetting on learning machines
- STACS 2004
- Toward a mathematical theory of inductive inference
Cited in
(8)- Learnability of automatic classes
- Automatic learners with feedback queries
- Learning automatic families of languages
- Automatic functions, linear time and learning
- Learnability of automatic classes
- Mind change speed-up for learning languages from positive data
- Learners based on transducers
- Learners based on transducers
This page was built for publication: Automatic Learners with Feedback Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091438)