GRAMMATICAL COMPLEXITY AND INFERENCE
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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 set of strings is investigated leading to a variety of positive and negative results. This work is part of a continuing effort to study the problems of representation and generalization through the grammatical inference question.
- Computer Programming and Software