You are on page 1of 3

Cc cu hi n thi phn l thuyt 1. 2. 3. 4. 5. 6. 7. Khi nim v ngn ng, t (chui, xu), mt s php ton c bn trn t v trn ngn ng.

Cc hnh thc biu din ngn ng. Cho v d minh ha. nh ngha vn phm, dn xut v ngn ng sinh bi vn phm. Cho v d minh ha. nh ngha vn phm, Phn loi vn phm theo Chomsky, s khc bit gia cc loi vn phm. Cho v d minh ha. Cho vn phm phi ng cnh G = < , , S, P >, hy ch ra rng xu w khc rng nm trong L(G) khi tn ti cy dn xut trong vn phm G m cc nt l ca n to nn xu w. Chng minh ngn ng sinh ra bi vn phm l ng vi php hp. Chng minh ngn ng sinh ra bi vn phm l ng vi php ghp (ni kt). Cho G = < , , S, P > khng phi l vn phm loi 0 vi k t xut pht S c v phi ca quy tc dn xut, ch ra rng tn ti vn phm G = < , , S, P > cng loi v tng ng vi G khng c k t xut pht v phi ca quy tc dn xut. Khi nim v vn phm phi ng cnh, khi nim v dn xut v cy dn xut, s nhp nhng ca vn phm. V d minh ha. Cho vn phm phi ng cnh G = < , , S, P > khng cha xu rng, trnh by gii thut loi b cc k hiu tha, lut sinh , lut sinh n v. nh ngha lut sinh . Cho vn phm phi ng cnh G = < , , S, P > khng cha xu rng, khng cha cc k hiu tha, trnh by gii thut loi b lut sinh . Cho vn phm phi ng cnh G = < , , S, P > khng cha xu rng, khng cha cc k hiu tha, khng cha lut sinh . Trnh by gii thut loi b lut sinh n v. Trnh by cc bc chun ha vn phm phi ng cnh v dng chun Chomsky tng ng. Cho v d minh ha chuyn mt vn phm phi ng cnh v dng chun Chomsky tng ng. Trnh by cc bc chun ha vn phm phi ng cnh v dng chun Greibach (khng cn nu v d minh ha). Trnh by khi nim v automat hu hn. Phn bit cc dng automata hu hn. Ngn ng on nhn bi automata hu hn. V d minh ha. Khi nim v automata Mealy, automata Moore, phn bit chng vi automata hu hn. Ly v d minh ha. Trnh by cc phng php biu din automata hu hn. V d minh ha. Trnh by thut ton on nhn chui bi mt automata hu hn cho trc. V d minh ha. Trnh by phng php bin i t automata khng n nh v automata n nh (a NFA v DFA). Trnh by phng php bin i t automata khng n nh c dch chuyn- v automata khng n nh v khng c dch chuyn- (a NFA v NFA). Dn v d minh ha. Trnh by phng php bin i t automata khng n nh c dch chuyn- v automata n nh (a NFA v DFA). Dn v d minh ha. nh ngha biu thc chnh quy. Thut ton xy dng automata t biu thc chnh quy gi l thut ton Thomson, trnh by thut ton Thomson.

8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22.

23. nh ngha biu thc chnh quy, trnh by thut ton xy dng biu thc chnh quy t mt automata hu hn cho trc. 24. Khi nim v vn phm chnh quy. Trnh by thut ton xy dng mt automata hu hn t mt vn phm chnh chnh quy tuyn tnh phi. 25. Khi nim v vn phm chnh quy. Trnh by thut ton xy dng mt automata hu hn t mt vn phm chnh chnh quy tuyn tnh tri. 26. Khi nim v vn phm chnh quy. Trnh by thut ton xy dng vn phm chnh chnh quy tuyn tnh phi t mt automata hu hn cho trc. V d minh ha. 27. Khi nim v vn phm chnh quy. Trnh by thut ton xy dng vn phm chnh chnh quy tuyn tnh tri t mt automata hu hn cho trc. V d minh ha. 28. Pht biu b bm (pumping lemma) cho tp hp chnh quy, gii thch, ngha ca b bm. Ly v d minh ha. 29. Nhng php ton no l ng vi tp hp chnh quy? Ly v d minh ha. 30. Nhng php ton no l ng vi vn phm phi ng cnh? V d minh ha. 31. Pht biu b bm (pumping lemma) cho tp hp (ngn ng) phi ng cnh. V d minh ha. 32. nh ngha pushdown automata, gii thch cc thnh phn. Cho v d minh ha. 33. Phn bit PDA n nh v PDA khng n nh. 34. Nu khi nim v my Turing, cc k thut xy dng my Turing, lp ngn ng on nhn bi my Turing. 35. Nu khi nim automata tuyn tnh gii ni, lp ngn ng on nhn bi automata tuyn tnh gii ni. Cc dng bi tp n thi Bin i tng ng gia cc dng automata hu hn; Bin i tng ng gia automata hu hn vi biu thc chnh quy v vn phm chnh quy; Rt gn, chun ha vn phm phi ng cnh. Bin i tng ng gia automata y xung v vn phm phi ng cnh; Cu hi ph 1. 2. 3. 4. Cho vn phm G = < , , S, P > trong = {S}, = {a1, a2, a3,, an}, tp quy tc c dng : P ={1.Sa.S, 2.Sa , a thuc T}. Tm L(G). Cho vn phm G = < , , S, P > trong = {S, A}, ={a, b}, tp quy tc c dng : P ={1.SSa, 2.AaAb, 3.Aab, 4.SAa }.Tm L(G). Cho vn phm G = < , , S, P > trong ={S, A}, ={a, b}, tp quy tc c dng: P={1. S Sa, 2. A aAb, 3. A ab, 4.S Aa}. Tm L(G). Xy dng automata hu hn tng ng vn phm G=<{0, 1}, {S, B, C}, S, P> trong P gm: 1. S 0B 2. C 1C 3. S 1C 4. C 1 5. B 0B 6. C 0 7. B 0S 8. S 0 Bi tp: Thit k PDA cho cc CFL sau:

5.

1. 2. 3. 4. 5. 6. 7.

{a b 0 m < n}. {a b 0 n < m}. {a b c d | m 0, n 0}. {a b c d | m 0, n 0}.


m n p q m m n n m n n m m n

m n

{a b c d | m + n = p + q}.
m n k

{a b c | m = n or m = k}. {a b c | m 0, n 0}.
n m 2n

Xy dng automata hu hn cho biu thc chnh quy sau theo thut ton Thomson: r = ((1+0)*(10)+)*. L l ngn ng chnh quy: LR c phi ngn ng chnh quy khng? Pref(L) c phi ngn ng chnh quy khng? Suf(L) c phi ngn ng chnh quy khng? Suf(pref(L)) c phi ngn ng chnh quy khng?

a,b q
0

a
a,b q1 a,b q2

a q
0

b b q1 a q2

0 q
0

1 0,1 1 q1

1 q
0

0,1

q1 1

0,1

q2

You might also like