INDUCTIVE INFERENCE OF FORMAL LANGUAGES FROM POSITIVE DATA

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] COMPLEXITY OF MINIMUM INFERENCE OF REGULAR SETS [J]. INFORMATION AND CONTROL, 1978, 39 (03): : 337 - 350

[3] ANGLUIN D, 1979, 11TH P ANN S THEOR C, P130

[4] Barzdin J. M., 1972, SOV MATH DOKL, V13, P1224

[5] INFERENCE OF TURING MACHINES FROM SAMPLE COMPUTATIONS [J]. ARTIFICIAL INTELLIGENCE, 1972, 3 (02) : 181 - 198

[6] TOWARD A MATHEMATICAL THEORY OF INDUCTIVE INFERENCE [J]. INFORMATION AND CONTROL, 1975, 28 (02): : 125 - 155

[7] CASE J, 1978, 10TH P ACM S THEOR C, P314

[8] SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY [J]. INFORMATION AND CONTROL, 1972, 20 (03): : 244 - &

[9] COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA [J]. INFORMATION AND CONTROL, 1978, 37 (03): : 302 - 320

[10] LANGUAGE IDENTIFICATION IN LIMIT [J]. INFORMATION AND CONTROL, 1967, 10 (05): : 447 - &

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] COMPLEXITY OF MINIMUM INFERENCE OF REGULAR SETS [J]. INFORMATION AND CONTROL, 1978, 39 (03): : 337 - 350

[3] ANGLUIN D, 1979, 11TH P ANN S THEOR C, P130

[4] Barzdin J. M., 1972, SOV MATH DOKL, V13, P1224

[5] INFERENCE OF TURING MACHINES FROM SAMPLE COMPUTATIONS [J]. ARTIFICIAL INTELLIGENCE, 1972, 3 (02) : 181 - 198

[6] TOWARD A MATHEMATICAL THEORY OF INDUCTIVE INFERENCE [J]. INFORMATION AND CONTROL, 1975, 28 (02): : 125 - 155

[7] CASE J, 1978, 10TH P ACM S THEOR C, P314

[8] SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY [J]. INFORMATION AND CONTROL, 1972, 20 (03): : 244 - &

[9] COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA [J]. INFORMATION AND CONTROL, 1978, 37 (03): : 302 - 320

[10] LANGUAGE IDENTIFICATION IN LIMIT [J]. INFORMATION AND CONTROL, 1967, 10 (05): : 447 - &