论文信息 - Learning Regular Sets from Queries and Counterexamples - 字舞流文

Learning Regular Sets from Queries and Counterexamples

Dana Angluin | D. Angluin

[1] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.

[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.

[3] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.

[4] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .

[5] Dana Angluin,et al. A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[6] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[7] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.

[8] E. Mark Gold,et al. System identification via state characterization , 1972 .