Accession Number : AD0740142

Title :   Array Automata and Array Grammars.

Descriptive Note : Technical rept.,

Corporate Author : MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s) : Milgram,David L. ; Rosenfeld,Azriel

Report Date : NOV 1970

Pagination or Media Count : 26

Abstract : It is shown that grammars that rewrite arrays are equivalent to Turing machines having array 'tapes', and that 'monotonic' array grammars (in which arrays never shrink in the course of a derivation) are equivalent to 'array-bounded' machines. It is also shown that two alternative definitions of 'array-bounded' are in fact equivalent. (Author)

Descriptors :   (*COMPUTER PROGRAMMING, GRAMMARS), MATHEMATICAL LOGIC, MAPPING(TRANSFORMATIONS), THEOREMS, PATTERN RECOGNITION

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE