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.
| Property | Value |
|---|
| dbpedia-owl:abstract
|
- 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.
- 在自动机理论中，嵌套堆栈自动机是可以利用持有作为附加栈的数据的栈的有限自动机。 嵌套堆栈自动机除了压入和弹出外还可以读它的栈。嵌套堆栈自动机有能力识别附标语言。
|
| dcterms:subject
| |
| rdf:type
| |
| rdfs:comment
|
- 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.
- 在自动机理论中，嵌套堆栈自动机是可以利用持有作为附加栈的数据的栈的有限自动机。 嵌套堆栈自动机除了压入和弹出外还可以读它的栈。嵌套堆栈自动机有能力识别附标语言。
|
| rdfs:label
|
- 嵌套堆栈自动机
- Nested stack automaton
|
| owl:sameAs
| |
| foaf:page
| |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
