Learning probabilistic automata: a study in state distinguishability
type: Item
instance of: scholarly article
title: Learning probabilistic automata: a study in state distinguishability
zbMATH Open document ID: 1257.68085
author: Borja Balle
author: Ricard Gavaldà
author: Jorge Castro
published in: Theoretical Computer Science
publication date: 2013-03-04T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6140788
zbMATH Keywords: distribution learning
zbMATH Keywords: PAC learning
zbMATH Keywords: probabilistic automata
zbMATH Keywords: statistical queries
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.10.009
OpenAlex ID: W2010633763
DOI: 10.1016/J.TCS.2012.10.009
Recommended article: Q3093192
Recommended article: Learning Theory
Recommended article: Learning deterministic probabilistic automata from a model checking perspective
Recommended article: Algorithmic Learning Theory
Recommended article: PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Recommended article: On the learnability and usage of acyclic probabilistic finite automata
Recommended article: A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Recommended article: Learning Probability Distributions Generated by Finite-State Machines
Recommended article: Learning probabilistic automata and Markov chains via queries
description: scientific article; zbMATH DE number 6140788