Re: 請問一下這個禮拜自動機的題目

[Freak1033 (金が信念! XD)]

※ 引述《inuy (開學真可怕)》之銘言：
: ㄟㄟ....
: 我是有修林智仁老師的自動機課程的學長...
: 因為我買了課本還沒有拿到....(今天中午上課到一點...上完就沒人可以領書了..QQ)
: 有沒有人可以PO一下這個禮拜的題目呀...
: 感恩呀....

1.3 The formal description of a DFA M is ({q[1], q[2], q[3], q[4], q[5]},
    {u,d}, δ, q[3], {q[3]}), where δ is given by the following table.
    Give the state diagram of this machine.

     |  u    d
-----+-------
q[1] | q[1] q[2]
q[2] | q[1] q[3]
q[3] | q[2] q[4]
q[4] | q[3] q[5]
q[5] | q[4] q[5]

1.4 Each of the following language is the intersection of two simpler
    languages. In each part, construct DFAs for the simpler languages, then
    combine them using the construction discussed in footnote 3 (page 46)
    to give the state diagram of a DFA for the language given. In all parts
    Σ = {a, b}.

a. {w | w has at least three a's and at least two b's}
c. {w | w has an even number of a's and one or two b's}
e. {w | w has an even number of a's and one or two b's}

1.10 Use the construction given in the proof of Theorem 1.49 to give the
     state diagrams of NFAs recognizing the star of the language described
     in

a. Exercise 1.6b. {w | w contains at least three 1s}
b. Exercise 1.6j. {w | w contains at least two 0s and at most one 1}
c. Exercise 1.6m. The empty set
---
裡面參考到的 footnote 3 (page 46) 以及 Theorem 1.49 有點長,
而且帶有圖片, 去找同學的看一下比較快.

--
その乾いた哀愁の瞳に去來するものは何か？
  失ったもの  得たもの
    そして廣大なネットの狹間で彼が見たものとは？
      虛像と實存と記號の中に彼は今、何を想うのか？

                        ＜バトルプログラマーシラセ＞

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 140.109.224.64
推 nameofevil:有1.10嗎@__@
推 Freak1033:有吧, 如果我沒有眼花的話.
推 yrclamb:我也記得有 ^^a
推 rofu:他的網站上說有!
推 babysilkwarm:輸了 == ==+ 害我打那麼久 :> <:
推 yrclamb:啊啊 XD 樓上的辛苦了 :p
推 davidsky:XD 我還準備幫原po借課本
推 inuy:感恩呀