Author:
Cicchello Orlando,Kremer Stefan C.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J. E. Hopcroft and J. D. Ullman, Formal Languages And Their Relation to Automata. Reading, Mass.: Addison-Wesley, 1969.
2. E. Gold, “Complexity of automaton identification from given data,” Information and Control, vol. 37, pp. 302–320, 1978.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, “Occam’s razor,” Information Processing Letters, vol. 24, pp. 377–380, 1987.
4. B. A. Trakhtenbrot and Y. M. Barzdin, Finite Automata. Amsterdam: North-Holland, 1973.
5. K. J. Lang, “Random DFA’s can be approximately learned from sparse uniform examples,” in Proceedings of the Fifth ACM Workshop on Computational Learning Theory, (New York, N.Y.), pp. 45–52, ACM, 1992.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献