Sciweavers

ALT
2010
Springer
13 years 6 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
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à