Learning probabilistic automata using residuals

DOI10.1007/978-3-030-85315-0_17MaRDI QIDQ2119983zbMATH OpenOpenAlexFDO

Authors Wenjing Chu, Shuo Chen, Marcello M. Bonsangue

Publication date 31 March 2022

Full work available at URL https://hdl.handle.net/1887/3257031

zbMATH Keywords

\(L_2\) distance between discrete distributionslearning automataprobabilistic automataresidual finite state automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 2019596
• Learning residual alternating automata
• Residuality and learning for nondeterministic nominal automata
• Learning residual finite-state automata using observation tables
• scientific article; zbMATH DE number 2038730
• Learning probabilistic automata: a study in state distinguishability
• Learning Theory
• Grammatical Inference: Algorithms and Applications
• Learning deterministic probabilistic automata from a model checking perspective
• Structural, Syntactic, and Statistical Pattern Recognition

Cites work

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
• Bioinformatics. The machine learning approach.
• Characteristic sets for polynomial grammatical inference
• Grammatical inference and applications. 2nd international colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994. Proceedings
• scientific article; zbMATH DE number 2019595 (Why is no real title available?)
• scientific article; zbMATH DE number 2019596 (Why is no real title available?)
• scientific article; zbMATH DE number 2080668 (Why is no real title available?)
• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• scientific article; zbMATH DE number 1916666 (Why is no real title available?)
• scientific article; zbMATH DE number 7646009 (Why is no real title available?)
• Identification with probability one of stochastic deterministic linear languages
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• The consensus string problem and the complexity of comparing hidden Markov models.

Describes a project that uses

Uses Software

• RFSA

This page was built for publication: Learning probabilistic automata using residuals

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