Author:
Angluin Dana,Becerra-Bonache Leonor,Dediu Adrian Horia,Reyzin Lev
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51(1), 76–87 (1981)
2. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1987)
3. Lecture Notes in Artificial Intelligence;L. Becerra-Bonache,2006
4. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics 7(4) (2002)
5. Freund, Y., Kearns, M.J., Ron, D., Rubinfeld, R., Schapire, R.E., Sellie, L.: Efficient learning of typical finite automata from random walks. Information and Computation 138(1), 23–48 (1997)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning event-driven switched linear systems;2021 Seventh Indian Control Conference (ICC);2021-12-20
2. Natural Language Processing, Moving from Rules to Data;Lecture Notes in Computer Science;2017