Publisher
Springer Berlin Heidelberg
Reference54 articles.
1. N. Abe and M. Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205–260, 1992.
2. D. Angluin. Inference of reversible languages. Journal of the Association for Computing Machinery, 29:741–765, 1982.
3. E. Baum and D. Haussler. What size net gives valid generalization? Neural Computation, 1:151–160, 1989.
4. L. E. Baum and T. Petrie. Statistical inference for probabilistic functions of finite state markov chains. Ann. Math. Stat., 37:1554–1563, 1966.
5. T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice Hall, Englewood Cliffs, N.J., 1990.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献