TIN HC L THUYT - 45 gi(Formal Languages and Automata Theory)

GII THIUGio vin: ThS. Phan Phng Lan

Mc tiuSau khi hon thnh hc phn ny, ngi hc cn nm vng: Khi nim l thuyt ngn ng, s phn cp v cch thc

biu din cc ngn ng t nhin cng nh ngn ng lp trnh.

Nguyn tc pht sinh ngn ng t vn phm, quy lut hnh thnh c php ngn ng lp trnh.

Nguyn tc hot ng v c ch dng on nhn ngn ng ca cc dng m hnh my tru tng tmt.

ng dng ca l thuyt ngn ng trong vic thit k cc phn mm nh trnh bin dch hay cc trnh x l vn bn.

Ni dung Chng 1 B tc ton Chng 2 Ngn ng v biu din ngn ng Chng 3 Automata hu hn v biu thc chnh quy Chng 4 Vn phm chnh quy v cc tnh cht Chng 5 Vn phm phi ng cnh Chng 6 Automata y xung Chng 7 My Turing Chng 8 Automata tuyn tnh gii ni v

vn phm phi ng cnh

Ti liu tham kho [1] V. H. Trm - Gio trnh Tin hc l thuyt i hc

Cn Th 2003. [2] Slide bi ging trn h thng elcit. [3] John E. Hopcroft, Jeffrey D.Ullman Introduction to

Automata Theory, Languages and Computation Addison Wesley Publishing Company, Inc 1979.

[4] V.J. Rayward-Smith A First course in Formal Language Theory (Second Editor) McGraw-Hill Book Company Europe 1995.

[5] H Vn Qun Gio trnh l thuyt tmt v ngn ng hnh thc Nh xut bn i hc quc gia Tp. HCh Minh 2002.

Kin thc tin quyt Hc xong hc phn v Ton ri rc. Quen thuc vi mt vi ngn ng lp trnh

cp cao. C cc khi nim c bn v Cu trc d liu

v gii thut.

Hnh thc nh gi im gia k: 30%

Thi trc nghim ti phng my khu 3 im cui k: 70%

Thi trc nghim ti phng my khu 3: 50% Lm bi tp ngay sau bui thi trc nghim:

20%

Lch hc Hc l thuyt trn lp: Tun 1 17 (ngh tt tun

4, 5) Kim tra gia k: Tun 10 Thi cui k: Tun 18 Cu hi?