Learning probabilistic automata: a study in state distinguishability

DOI10.1016/J.TCS.2012.10.009zbMATH Open1257.68085OpenAlexW2010633763MaRDI QIDQ1939261FDOQ1939261

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

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

zbMATH Keywords

probabilistic automataPAC learningstatistical queriesdistribution learning

Mathematics Subject Classification ID

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

Cited In (16)

• A lower bound for learning distributions generated by probabilistic automata
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• Title not available (Why is that?)
• 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
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• 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
• 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

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)