Eecient Learning of Typical Finite Automata from Random Walks Extended Abstract
暂无分享,去创建一个
Y. Freund | M. Kearns | D. Ron | Linda Sellie | R. Rubinfeld
[1] Dana Ron,et al. On the learnability and usage of acyclic probabilistic finite automata , 1995, COLT '95.
[2] Ronitt Rubinfeld,et al. On the learnability of discrete distributions , 1994, STOC '94.
[3] Leslie G. Valiant,et al. Cryptographic limitations on learning Boolean formulae and finite automata , 1994, JACM.
[4] Kevin J. Lang. Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.
[5] Yossi Azar,et al. Biased random walks , 1992, STOC '92.
[6] N. Merhav,et al. Universal prediction of individual sequences , 1991, 17th Convention of Electrical and Electronics Engineers in Israel.
[7] Leonard Pitt,et al. Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..
[8] Avrim Blum. Some tools for approximate 3-coloring , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] Leonard Pitt,et al. The minimum consistent DFA problem cannot be approximated within any polynomial , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[10] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[11] Ronald L. Rivest,et al. Learning complicated concepts reliably and usefully , 1988, Annual Conference Computational Learning Theory.
[12] David Haussler,et al. Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.
[13] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.
[14] Ronald L. Rivest,et al. Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[15] Umesh V. Vazirani,et al. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..
[16] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[17] Miklos Santha,et al. Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..
[18] Leslie Pack Kaelbling,et al. Inferring finite automata with stochastic output functions and an application to map learning , 1992, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[19] Vijay V. Vazirani,et al. Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[20] Oded Goldreich,et al. Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[21] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[22] DANA ANGLUIN,et al. On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..
[23] Boris A. Trakhtenbrot,et al. Finite automata : behavior and synthesis , 1973 .
[24] E. Mark Gold,et al. System identification via state characterization , 1972 .