Accession Number : AD0651063

Title :   A GENERALIZATION OF CONTEXT FREE DETERMINISM,

Corporate Author : SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s) : Hibbard,Thomas N.

Report Date : 21 NOV 1966

Pagination or Media Count : 71

Abstract : Nondeterministic Turing machines, under the restriction that each square be written on only a fixed number of times, recognize all and only context free languages. The deterministic subclass gives rise to a hierarchical extension of the pushdown deterministic languages. Unambiguity in terms of the machines is the same as grammatical unambiguity. (Author)

Descriptors :   (*AUTOMATA, COMPUTER PROGRAMMING), CONTEXT FREE GRAMMARS, THEORY

Subject Categories : Linguistics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE