問題詳情

XI Many string-matching algorithms build a finite automata. Below is a partially-completed statetransition function for a string s of length 10 over the alphabet f {A, B, C}. It is possible to reconstructs from the partial table. How many A's does the string s have?__ (18)__


(A) 4
(B) 5
(C) 6
(D) 7

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增