在自动机理论中，嵌套堆栈自动机是可以利用持有作为附加栈的数据的栈的有限自动机。 嵌套堆栈自动机除了压入和弹出外还可以读它的栈。嵌套堆栈自动机有能力识别附标语言。

• 自动机

In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks. Like a stack automaton, a nested stack automaton may step up or down in the stack, and read the current symbol; in addition, it may at any place create a new stack, operate on that one, eventually destroy it, and continue operating on the old stack. This way, stacks can be nested recursively to an arbitrary depth; however, the automaton always operates on the innermost stack only.