Accession Number : AD0668088

Title :   TWO-WAY BALLOON AUTOMATA AND AFL,

Corporate Author : SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s) : Ginsburg,Seymour ; Hopcroft,John

Report Date : 25 JAN 1968

Pagination or Media Count : 32

Abstract : It is shown that if the family of languages accepted by a closed class of two-way balloon automata is closed under length-preserving homomorphism, then this family is an AFL closed under intersection and e-free substitution. It is then proved that the family of languages accepted by the closed class of two-way balloon automata of (nonerasing) (deterministic) stack acceptors is such a family. (Author)

Descriptors :   (*LANGUAGE, SET THEORY), AUTOMATION, MATHEMATICAL MODELS, CONTEXT FREE GRAMMARS, SYMBOLS, ACCEPTABILITY, MATHEMATICAL ANALYSIS, STATISTICAL FUNCTIONS, MAPPING, SCANNING, SIMULATION, DATA STORAGE SYSTEMS, INFORMATION RETRIEVAL

Subject Categories : Linguistics
      Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE