Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage

Abstract

It cannot be decided whether a one-counter automaton accepts each string in its language using a counter whose value is bounded by a constant. Furthermore, when the counter is bounded by a constant, its value cannot be limited by any recursive function in the size of the machine. We consider three measures: the costs of all computations (strong measure), all accepting computations (accept measure), and the least expensive accepting computation (weak measure). By taking into account the strong and accept measures, the above-mentioned problem becomes decidable for both pushdown automata and one-counter automata. Moreover, the bounds for the pushdown height or the value of the counter, when non constant, are recursive in the size of the machine. We also prove that, under the weak measure, if a one-counter automaton accepts with a counter that, with respect to the input length is not bounded by any constant, then the counter grows at least as a logarithmic function. This bound can be reached. This is in contrast with the case of pushdown automata in which the optimal bound is double logarithmic. For the strong and accept measures these bounds are shown to be linear, for both pushdown and one-counter automata.