プッシュダウン・オートマトン
1. Pushdown automatonIn automata theory, a pushdown automaton (PDA) is a variation of finite automaton that can make use of a stack containing data.
Read “Pushdown automaton” on English Wikipedia
Read “プッシュダウン・オートマトン” on Japanese Wikipedia
Read “Pushdown automaton” on DBpedia
Read “Pushdown automaton” on English Wikipedia
Read “プッシュダウン・オートマトン” on Japanese Wikipedia
Read “Pushdown automaton” on DBpedia
Discussions
Log in to talk about this word.