Learning probabilistic automata: a study in state distinguishability

DOI10.1016/J.TCS.2012.10.009MaRDI QIDQ1939261zbMATH OpenOpenAlexFDO

Authors Borja Balle, Ricard Gavaldà, Jorge Castro

Publication date 4 March 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.10.009

zbMATH Keywords

probabilistic automataPAC learningstatistical queriesdistribution learning

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5957212
• Learning Theory
• Learning deterministic probabilistic automata from a model checking perspective
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• On the learnability and usage of acyclic probabilistic finite automata
• A lower bound for learning distributions generated by probabilistic automata
• Learning probability distributions generated by finite-state machines
• Learning probabilistic automata and Markov chains via queries

Cited in

(17)

• A lower bound for learning distributions generated by probabilistic automata
• 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?)
• Learning probabilistic automata using residuals
• Learning a Random DFA from Uniform Strings and State Information
• Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
• On the learnability and usage of acyclic probabilistic finite automata
• Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule
• A comparison of collapsed Bayesian methods for probabilistic finite automata
• Adaptively learning probabilistic deterministic automata from data streams
• Spectral learning of weighted automata. A forward-backward perspective
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Learning probabilistic automata and Markov chains via queries
• State identification, existence of sequences and machine classification
• FlexFringe: modeling software behavior by learning probabilistic automata

This page was built for publication: Learning probabilistic automata: a study in state distinguishability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939261)