Author:
Sugimoto Noriko,Toyoshima Takashi,Shimozono Shinichi,Hirata Kouichi
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Angluin, D.: Learning k-bounded context-free grammars, Technical Report YALEU/DCS/RR-557, Yale University (1987)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
3. Angluin, D.: Query and concept learning. Machine Learning 2, 319–342 (1988)
4. Bloomfield, L.: Language. Holt, Rinehart & Winston (1933)
5. Berman, P., Roods, R.: Learning one-counter languages in polynomial time. In: Proc. 28th IEEE Symposium on Foundation of Computer Science, pp. 61–67 (1987)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献