作者hoverg ()
看板Grad-ProbAsk
标题[理工] 离散-有限状态机
时间Thu Jun 18 08:35:14 2009
A three state finite state machine has {0,1} as its input and output
alphabets. Given the following input sequence and its corresponding output
sequence, determine the machine.
Input sequence:00010101
Output sequence:011001110
请大家指教罗~谢谢^ ^
--
家家是家，到家才是家~道道是道，放下见大道
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.120.210.202