Author:
Balle Borja,Castro Jorge,Gavaldà Ricard
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Carrasco, R.C.: Accurate computation of the relative entropy between stochastic regular grammars. RAIRO (Theoretical Informatics and Applications) 31(5), 437–444 (1997)
2. Lecture Notes in Artificial Intelligence;J. Castro,2008
3. Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research (2004)
4. Dupont, P., Denis, F., Esposito, Y.: Links between probabilistic automata and hidden markov models: probability distributions, learning models and induction algorithms. Pattern Recognition 38(9), 1349–1371 (2005)
5. Lecture Notes in Artificial Intelligence;R. Gavaldà,2006
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献