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