Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Learning probabilistic automata: a study in state distinguishability

From MaRDI portal
Publication:1939261
Jump to:navigation, search

DOI10.1016/j.tcs.2012.10.009zbMath1257.68085OpenAlexW2010633763MaRDI QIDQ1939261

Ricard Gavaldà, Borja Balle, Jorge E. 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

PAC learningprobabilistic automatastatistical queriesdistribution learning


Mathematics Subject Classification ID

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


Related Items (3)

Spectral learning of weighted automata. A forward-backward perspective ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ A comparison of collapsed Bayesian methods for probabilistic finite automata




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1939261&oldid=14375681"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki