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

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

答案：登入後查看
統計： 尚無統計資料