摘要:
acm.org
sci-hub.se 参考文章(9)
Efim Kinber, Learning A Class of Regular Expressions via Restricted Subset Queries AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference. pp. 232- 243 ,(1992) , 10.1007/3-540-56004-1_16
Alvis Brāzma, Inductive Synthesis of Dot Expressions Baltic Computer Science, Selected Papers. pp. 156- 212 ,(1991) , 10.1007/BFB0019359
Rolf Wiehagen, From Inductive Inference to Algorithmic Learning Theory algorithmic learning theory. ,vol. 12, pp. 13- 24 ,(1992) , 10.1007/3-540-57369-0_24
Dana Angluin, Learning regular sets from queries and counterexamples Information & Computation. ,vol. 75, pp. 87- 106 ,(1987) , 10.1016/0890-5401(87)90052-6
J.M. Barzdin, G.J. Barzdin, Rapid construction of algebraic axioms from samples Theoretical Computer Science. ,vol. 90, pp. 199- 208 ,(1991) , 10.1016/0304-3975(91)90307-N
L. G. Valiant, A theory of the learnable symposium on the theory of computing. ,vol. 27, pp. 1134- 1142 ,(1984) , 10.1145/800057.808710
Dana Angluin, A note on the number of queries needed to identify regular languages Information & Computation. ,vol. 51, pp. 76- 87 ,(1981) , 10.1016/S0019-9958(81)90090-5
Dana Angluin, Equivalence queries and approximate fingerprints conference on learning theory. pp. 134- 145 ,(1989) , 10.5555/93335.93351
Alvis Brāzma, Learning a subclass of regular expressions by recognizing periodic repetitions scandinavian conference on ai. pp. 137- 146 ,(1993)