An automaton is k-visit-bounded if during any computation its work tape head visits each tape cell at most k times. In this paper we consider stack automata which are k-visit-bounded for some integer k. This restriction resets the visits when popping (unlike similarly defined Turing machine restrictions) which we show allows the model to accept a proper superset of context-free languages and also a proper superset of languages of visit-bounded Turing machines. We study two variants of visit-bounded stack automata: one where only instructions that move the stack head downwards increase the number of visits of the destination cell, and another where any transition increases the number of visits. We prove that the two types of automata recognize the same languages. We then show that all languages recognized by visit-bounded stack automata are effectively semilinear, and hence are letter-equivalent to regular languages, which can be used to show other properties.

如果在任何计算期间，自动机的工作磁带头最多访问每个磁带单元k次，则该自动机是k 访问有界的。在本文中，我们考虑堆栈自动机，对于某个整数k ，它是k访问有界的。此限制在弹出时重置访问（与类似定义的图灵机限制不同），我们展示的允许模型接受上下文无关语言的适当超集以及访问限制图灵机的语言的适当超集。我们研究了访问有界堆栈自动机的两种变体：一种是仅向下移动堆栈头的指令会增加目标单元的访问次数，另一种是任何转换都会增加访问次数。我们证明这两种类型的自动机可以识别相同的语言。然后，我们证明访问有界堆栈自动机识别的所有语言实际上都是半线性的，因此与常规语言在字母上等效，可用于显示其他属性。