[理工] [離散]狀態機
午安…
For the below finite state machine , let x be an input string with length 3.
if 0 is a suffix of the output string , how many possibilities are there for
the string x？
a,1 b,0
_________ _____
↖ ↙ ↑ ↙
a,1 ↖ ↙ b,0 ↑↙
→→S0→→→→S1→→→→S2
↑↘ b,0 ↗↓
↑ →→→→→→→→ ↓
↖__________________↙
a,0
如果遇到這種題目，應該怎麼求解…
ANS ：6
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 111.252.191.206
※ 編輯: VB2005 來自: 111.252.191.206 (10/15 14:00)
※ 編輯: VB2005 來自: 111.252.191.206 (10/15 14:04)
推
10/15 19:39, , 1F
10/15 19:39, 1F
→
10/15 19:43, , 2F
10/15 19:43, 2F
推
10/15 20:43, , 3F
10/15 20:43, 3F
→
10/15 20:45, , 4F
10/15 20:45, 4F