Accession Number : AD0682981

Title :   INTERCALATION THEOREMS FOR PUSHDOWN STORE AND STACK LANGUAGES,

Corporate Author : STANFORD UNIV CALIF DEPT OF MATHEMATICS

Personal Author(s) : Ogden,William Frederick

Report Date : DEC 1968

Pagination or Media Count : 72

Abstract : The thesis develops necessary conditions for languages to be context-free, deterministic context-free, stack generable, stack decidable, and non-erasing stack generable. The result for context-free languages is a generalization of the well known necessary condition of Bar-Hillel et al., but it does provide an alternative approach to inherent ambiguity in context-free languages. (Author)

Descriptors :   (*ARTIFICIAL INTELLIGENCE, *CONTEXT FREE GRAMMARS), LEARNING MACHINES, ADAPTIVE SYSTEMS, GROUPS(MATHEMATICS), POLYNOMIALS, AUTOMATA, THEOREMS, THESES

Subject Categories : Linguistics
      Bionics

Distribution Statement : APPROVED FOR PUBLIC RELEASE