Learning probability distributions generated by finite-state machines

DOI10.1007/978-3-662-48395-4_5zbMATH Open1404.68057OpenAlexW2480820881MaRDI QIDQ2963596FDOQ2963596

Authors: Ricard Gavaldà, Jorge Castro 

Publication date: 15 February 2017

Published in: Topics in Grammatical Inference (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/100347

Recommendations

• scientific article; zbMATH DE number 5957212
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Learning Theory
• scientific article; zbMATH DE number 2019596
• Grammatical Inference: Algorithms and Applications

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Language identification in the limit
• A theory of the learnable
• On the definition of a family of automata
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Title not available (Why is that?)
• Realizations by stochastic finite automata
• On the computational complexity of approximating distributions by probabilistic automata
• The power of amnesia: Learning probabilistic automata with variable memory length
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• Learning functions represented as multiplicity automata

Cited In (10)

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Dimension-free concentration bounds on Hankel matrices for spectral learning
• Structural transformations of probabilistic finite state machines
• Abductive learning of quantized stochastic processes with probabilistic finite automata
• Links between multiplicity automata, observable operator models and predictive state representations -- a unified learning framework
• Title not available (Why is that?)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• A comparison of collapsed Bayesian methods for probabilistic finite automata
• \(L^*\)-based learning of Markov decision processes
• Learning probabilistic automata: a study in state distinguishability

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)