One-way stack automata
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison · Journal of the ACM · 1967
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.