The Community for Technology Leaders
8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)
Texas
Oct. 18, 1967 to Oct. 20, 1967
pp: 37-44
ABSTRACT
A stack automaton is a device with a pushdown list which can be read by its storage head in a read only mode. In this paper, we show two properties of stack automata with a one-way input. (1) If a language is accepted by a nondeterministic one-way stack automaton, then it is accepted by a deterministic linear bounded automaton. (2) If a language, L, is accepted by a deterministic one-way stack automaton, and R is a regular set, then L/R = {x for some y in R, xy is in L} is accepted by a deterministic one-way stack automaton.
INDEX TERMS
CITATION

J. D. Ullman and J. E. Hopcroft, "Two results on one-way stack automata," 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS), Texas, 1967, pp. 37-44.
doi:10.1109/FOCS.1967.37
94 ms
(Ver 3.3 (11022016))