[理工] [離散]96中正資工
題目如下:
Consider the finite automata with three states x, y, z
over the alphabet {a, b}, where x is always the start state.
How many different possibilities are there for this kind of
finite automata?Show your detailed calculations.
一 一" 我看不太懂
求不同可能的話...感覺會無限?
(我想法 不管丟a or b有可能有xyz都可能出現 那不就會..
有xxxxxxxxx~~~y or z 不就無限個了?)
另外就是這狀態機 我也畫不出來...
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 121.254.84.213
※ 編輯: pigcat1315 來自: 121.254.84.213 (03/08 21:36)
→
03/09 14:41, , 1F
03/09 14:41, 1F
→
03/10 12:28, , 2F
03/10 12:28, 2F
→
03/10 12:29, , 3F
03/10 12:29, 3F
→
03/10 12:30, , 4F
03/10 12:30, 4F
→
03/10 12:31, , 5F
03/10 12:31, 5F