GRAMMATICAL COMPLEXITY AND INFERENCE
Jerome A. Feldman, James Gips, James J. Horning, Stephen Reder · 1969
i L i i L-i IL-i i L The problem of inferring a grammar for a set of symbol strings is considered and a number of new decidability results obtained. Several notions of grammatical complexity and their properties are studied. The question of learning the least complex grammar for a