NEGATIVE RESULTS FOR EQUIVALENCE QUERIES

[1] Angluin D., 1988, Machine Learning, V2, P319, DOI 10.1023/A:1022821128753

[2] A NOTE ON THE NUMBER OF QUERIES NEEDED TO IDENTIFY REGULAR LANGUAGES [J]. INFORMATION AND CONTROL, 1981, 51 (01): : 76 - 87

[3] INFERENCE OF REVERSIBLE LANGUAGES [J]. JOURNAL OF THE ACM, 1982, 29 (03) : 741 - 765

[4] LEARNING REGULAR SETS FROM QUERIES AND COUNTEREXAMPLES [J]. INFORMATION AND COMPUTATION, 1987, 75 (02) : 87 - 106

[5] ANGLUIN D, 1989, UCBCSD89528 U CAL BE

[6] ANGLUIN D, 1989, TR89050 INT COMP SCI

[7] ANGLUIN D, 1988, YALEDCSRR648 YAL U D

[8] ANGLUIN D, 1988, YALEDCSRR659 YAL U D

[9] ANGLUIN D, 1989, 2ND P WORKSH COMP LE, P134

[10] OCCAM RAZOR [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (06) : 377 - 380

[1] Angluin D., 1988, Machine Learning, V2, P319, DOI 10.1023/A:1022821128753

[2] A NOTE ON THE NUMBER OF QUERIES NEEDED TO IDENTIFY REGULAR LANGUAGES [J]. INFORMATION AND CONTROL, 1981, 51 (01): : 76 - 87

[3] INFERENCE OF REVERSIBLE LANGUAGES [J]. JOURNAL OF THE ACM, 1982, 29 (03) : 741 - 765

[4] LEARNING REGULAR SETS FROM QUERIES AND COUNTEREXAMPLES [J]. INFORMATION AND COMPUTATION, 1987, 75 (02) : 87 - 106

[5] ANGLUIN D, 1989, UCBCSD89528 U CAL BE

[6] ANGLUIN D, 1989, TR89050 INT COMP SCI

[7] ANGLUIN D, 1988, YALEDCSRR648 YAL U D

[8] ANGLUIN D, 1988, YALEDCSRR659 YAL U D

[9] ANGLUIN D, 1989, 2ND P WORKSH COMP LE, P134

[10] OCCAM RAZOR [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (06) : 377 - 380