出典:Wikipedia
出典:『Wikipedia』 (2011/02/28 17:23 UTC 版)
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. A nested stack automaton may read its stack, in addition to pushing or popping it. A nested stack automaton is capable of recognizing an indexed language.