Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ALT
2010
Springer

favoriteEmaildiscussreport

122views Machine Learning» more ALT 2010»

A Lower Bound for Learning Distributions Generated by Probabilistic Automata

13 years 6 months ago

A Lower Bound for Learning Distributions Generated by Probabilistic Automata

Download www.lsi.upc.edu

Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability

Borja Balle, Jorge Castro, Ricard Gavaldà

Real-time Traffic

Algorithm | ALT 2010 | Machine Learning | Queries Termed L-queries | Statistical Queries |

claim paper

Related Content

» PACLearnability of Probabilistic Deterministic Finite State Automata in Terms of Variation...

» Learning Probabilistic Automata with Variable Memory Length

» On the Learnability and Usage of Acyclic Probabilistic Finite Automata

» Learning Classes of Probabilistic Automata

» Conditional Automata A Tool for Safe Removal of Negligible Events

» Bisimilarity of OneCounter Processes Is PSPACEComplete

» Learning PDFA with Asynchronous Transitions

» Learning Rational Stochastic Languages

» An Inequality for Nearly LogConcave Distributions with Applications to Learning

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	ALT
Authors	Borja Balle, Jorge Castro, Ricard Gavaldà

Comments (0)