My today CS402 paper 2013
1. Write CFG for (a+b)* and remove null production.Marks 3
2. Even-Even Language {a,b} may partition E*, Explain briefly Marks 5
3. Write CNF for A-->BAB | B | ^ Marks 5
B--> 00 | ^
4. convert NFA into FA using transition table. Marks 5
a b
a,b <O----------->O--------->O> a,b
x1 x2 x3
n n+1
5. Draw PDA a b Marks 5
1. Write CFG for (a+b)* and remove null production.Marks 3
2. Even-Even Language {a,b} may partition E*, Explain briefly Marks 5
3. Write CNF for A-->BAB | B | ^ Marks 5
B--> 00 | ^
4. convert NFA into FA using transition table. Marks 5
a b
a,b <O----------->O--------->O> a,b
x1 x2 x3
n n+1
5. Draw PDA a b Marks 5
0 comments
Post a Comment