Accession Number : AD0693106

Title :   SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Feldman,Jerome

Report Date : AUG 1969

Pagination or Media Count : 28

Abstract : The problem of grammatical inference is considered and a number of positive answers to decidability questions obtained. Conditions are prescribed under which it is possible for a machine to infer a grammar (or the best grammar) for even the general rewriting systems. (Author)

Descriptors :   (*LEARNING MACHINES, *GRAMMARS), ARTIFICIAL INTELLIGENCE, PROGRAMMING LANGUAGES, SET THEORY, SYMBOLS, THEOREMS

Subject Categories : Linguistics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE