Learning Rational Stochastic Tree Languages
暂无分享,去创建一个
[1] José Oncina,et al. Learning Multiplicity Tree Automata , 2006, ICGI.
[2] Jean Berstel,et al. Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..
[3] Juan Ramón Rico-Juan,et al. Probabilistic k-Testable Tree Languages , 2000, ICGI.
[4] Zoltán Ésik,et al. Formal Tree Series , 2002 .
[5] Hubert Comon,et al. Tree automata techniques and applications , 1997 .
[6] François Denis,et al. Learning Classes of Probabilistic Automata , 2004, COLT.
[7] Amaury Habrard,et al. A Polynomial Algorithm for the Inference of Context Free Languages , 2008, ICGI.
[8] L. Györfi. Principles of nonparametric learning , 2002 .
[9] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[10] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[11] Amaury Habrard,et al. Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference , 2006, ICGI.
[12] François Denis,et al. Rational stochastic languages , 2006, ArXiv.
[13] Jorge Calera-Rubio,et al. Stochastic Inference of Regular Tree Languages , 1998, ICGI.
[14] C. S. Wetherell,et al. Probabilistic Languages: A Review and Some Open Questions , 1980, CSUR.
[15] Naoki Abe,et al. Predicting Protein Secondary Structure Using Stochastic Tree Grammars , 1997, Machine Learning.
[16] Gábor Lugosi,et al. Pattern Classification and Learning Theory , 2002 .
[17] Heiko Vogler,et al. Learning Deterministically Recognizable Tree Series , 2007, J. Autom. Lang. Comb..
[18] Amaury Habrard,et al. Learning Rational Stochastic Languages , 2006, COLT.