On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
The two main results of the paper are: (1) a fine hierarchy of reversal-bounded counter machine languages; and (2) a tape is better than a pushdown store for twoway machines, in the case where their size is sublinear.
KeywordsInternal Computation Input Tape Counter Machine Pushdown Automaton Input Head
Unable to display preview. Download preview PDF.
- T-h. Chan, “Reversal complexity of counter machines,” Proc. 13th Annual STOC, Milwaukee, 1981, pp. 146–157.Google Scholar
- P. DŪri¯s and Z. Galil, “Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines,” Proc. 13th Annual STOC, Milwaukee, 1981, pp. 177–188.Google Scholar