determinate automaton
基本解釋
- [數(shù)學(xué)]確定性自動(dòng)機(jī)
英漢例句
- An algorithm of pattern matching was proposed based on determinate finite automaton(DFA) for the problem of quick abnormal patterns matching in quality statistical process control(SPC).
針對(duì)質(zhì)量統(tǒng)計(jì)過(guò)程控制(SPC)中的異常模式快速匹配問(wèn)題,提出了基於確定有限自動(dòng)機(jī)(DFA)的模式匹配算法,給出了能利用DFA進(jìn)行匹配的基於多維輸入數(shù)據(jù)的模式串定義。
雙語(yǔ)例句
專(zhuān)業(yè)釋義
- 確定性自動(dòng)機(jī)