SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY,

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)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1969
Accession Number
AD0693106

Entities

People

  • Jerome Feldman

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Artificial Intelligence

Readers

  • Computational Linguistics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)

Technology Areas

  • AI & ML
  • AI & ML - Machine Translation