Inductive inference of formal languages from positive data

Aho, 1974

Angluin, 1978, On the complexity of minimum inference of regular sets, Inform Contr., 39, 337, 10.1016/S0019-9958(78)90683-6

Angluin, 1979, Finding patterns common to a set of strings, 130

Barzdin, 1972, On the prediction of general recursive functions, Soviet Math. Dokl., 13, 1224

Biermann, 1972, On the inference of Turing machines from sample computations, Artificial Intelligence, 3, 181, 10.1016/0004-3702(72)90048-3

Blum, 1975, Toward a mathematical theory of inductive inference, Inform. Contr., 28, 125, 10.1016/S0019-9958(75)90261-2

Case, 1978, Anomaly hierarchies of mechanized inductive inference, 314

Feldman, 1972, Some decidability results on grammatical inference and complexity, Inform. Contr., 20, 244, 10.1016/S0019-9958(72)90424-X

Gold, 1967, Language identification in the limit, Inform. Contr., 10, 447, 10.1016/S0019-9958(67)91165-5

Gold, 1978, Complexity of automaton identification from given data, Inform. Contr., 37, 302, 10.1016/S0019-9958(78)90562-4

Kugel, 1977, Induction, pure and simple, Inform. Contr., 35, 276, 10.1016/S0019-9958(77)90175-9

Rogers, 1967

Solomonoff, 1964, A formal theory of inductive inference, Inform. Contr., 7, 1, 10.1016/S0019-9958(64)90223-2

Solomonoff, 1964, A formal theory of inductive inference, Inform. Contr., 7, 234