Algorithmic Learning Theory
From MaRDI portal
Publication:5395035
Recommendations
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- scientific article; zbMATH DE number 5957212
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- A lower bound for learning distributions generated by probabilistic automata
- Learning probabilistic automata: a study in state distinguishability
Cited in
(8)- On the learnability and usage of acyclic probabilistic finite automata
- A lower bound for learning distributions generated by probabilistic automata
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Algorithmic Learning Theory
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- Learning probabilistic automata: a study in state distinguishability
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
This page was built for publication: Algorithmic Learning Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395035)