Learning probability distributions generated by finite-state machines
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- Language identification in the limit
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning functions represented as multiplicity automata
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On the computational complexity of approximating distributions by probabilistic automata
- On the definition of a family of automata
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Realizations by stochastic finite automata
- The power of amnesia: Learning probabilistic automata with variable memory length
Cited in
(11)- Learning probabilistic automata: a study in state distinguishability
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- scientific article; zbMATH DE number 1670712 (Why is no real title available?)
- Dimension-free concentration bounds on Hankel matrices for spectral learning
- Abductive learning of quantized stochastic processes with probabilistic finite automata
- Structural transformations of probabilistic finite state machines
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- A comparison of collapsed Bayesian methods for probabilistic finite automata
- Links between multiplicity automata, observable operator models and predictive state representations -- a unified learning framework
- L^*-based learning of Markov decision processes
- The power of amnesia: Learning probabilistic automata with variable memory length
This page was built for publication: Learning probability distributions generated by finite-state machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963596)
