(a)construct a finite-state machine M1 whose output tells the number
of finite symbols, module 3,that have been applied
(b)the input and output alphabets of M2 are {0,1}.
construct a Finite-state machine M2 whose output sequence
r(t)r(t-1)...r(1) is to be replica of the input sequence
s(t)s(t-1)...s(1) delayed by two unit: r(t)=s(t-2) fot t>2
we do not care r(1) and r(2) are.
題目搞不太懂
我第一題大致上是寫成
->(s0)------->(s1)--------(s2)------->(s3)
t,1 t,2 t,0
output 給 0 1 2 by mod 3
最後答案是給
a,1 a,2
->(s0)-------->(s1)---->(s2)
^ |
|---------------------/
a,0
第二題我就真的沒有頭緒了
希望有高手可以指教一下 感恩
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 123.204.101.212