ONE-WAY STACK AUTOMATA.
Abstract
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential transduction preserves the former; set complementation, the latter. Several solvability questions are also considered. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 22, 1966
- Accession Number
- AD0636032
Entities
People
- Michael A. Harrison
- Seymour Ginsburg
- Sheila A. Greibach
Organizations
- System Development Corporation