Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5957212
- Learning probabilistic automata: a study in state distinguishability
- A lower bound for learning distributions generated by probabilistic automata
- Algorithmic Learning Theory
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Cited in
(14)- On the learnability and usage of acyclic probabilistic finite automata
- Efficient learning of typical finite automata from random walks
- Learning deterministic probabilistic automata from a model checking perspective
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- Spectral learning of weighted automata. A forward-backward perspective
- Adaptively learning probabilistic deterministic automata from data streams
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- A comparison of collapsed Bayesian methods for probabilistic finite automata
- Improving active Mealy machine learning for protocol conformance testing
- A lower bound for learning distributions generated by probabilistic automata
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- FlexFringe: modeling software behavior by learning probabilistic automata
This page was built for publication: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528416)