Halting Stack Automata

Authors:
J. D. Ullman
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, N.J. and Bell Telephone Laboratories, Inc., Murray Hill, New Jersey
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 4
Cited 3

Stack automata and compiling

Journal of the ACM (JACM)
One-way stack automata

Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata

Two-way balloon automata and AFL

Journal of the ACM (JACM)
Two-way nested stack automata are equivalent to two-way stack automata

Journal of Computer and System Sciences
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that every two-way (deterministic) stack automaton language is accepted by a two-way (deterministic) stack automaton which for each input has a bound on the length of a valid computation. As a consequence, two-way deterministic stack languages are closed under complementation.