Halting Stack Automata-Reference-Cited by-同舟云学术

Halting Stack Automata

Published:1969-10 Issue:4 Volume:16 Page:550-563
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Ullman J. D.¹

Affiliation:

1. Department of Electrical Engineering, Princeton University, Princeton, N.J. and Bell Telephone Laboratories, Inc., Murray Hill, New Jersey

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321541.321544

Reference9 articles.

1. Stack automata and compiling

2. Nonerasing stack automata

3. One-way stack automata

4. Deterministic stack automata and the quotient operator

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Supercounter machines;Automata, Languages and Programming;1979

2. Two-way nested stack automata are equivalent to two-way stack automata;Journal of Computer and System Sciences;1975-06

3. Jede mit Stackautomaten berechenbare Funktion ist elementar;Archiv für Mathematische Logik und Grundlagenforschung;1972-03

4. 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;1971-04

5. Two-way balloon automata and AFL;Journal of the ACM;1970-01