PART A (10 x2 =20 marks)

/ Z} 't"- {
Let M = (Q, J.:, 5, qO, F) where Q= {qO, ql , q , ~- a, b} F= {q2}
-
6 a b
r+q o q1 qo
1.
q1 q1 q2
*q2 q2 q2
acc e ted b
Sho w tha t the stri n w = "bbabb" is
ula r set.
2. Lis ts the Clo sur e pro per ties on Reg
3. Dis ting uis h bet we en D FA and NFA
gua ge (b• (aa a)•b •J
4. Give the Eng lish des crip tion of the lan
r exp ress ion ab
5. Con stru ct the finite aut om ata for reg ula
of all stri ngs wit h eve n num ber of a's
Wr ite the reg ula r exp ress ion for the set
6. and odd num ber ofb 's.
7. Sta te Ard en's the ore m.
lica tion s of pum pin g Lem ma.
8. State pum pin g Lem ma and List out the app
ion wit h£ tran siti on (ab)*
9. Construct NFA for the following exp ress
10. Removal of Unit Pro duc tion s- Discuss
two stri ngs reje cted by the foll owi ng
Give two stri ngs tha t are acc ept ed and
}, l>, qo, {q2}).
finite aut om ata M= ({qo, q1, q2, q3, q4}, {0,1

11.
1 1
1

0
owi ng non -de term inis tic finite aut om ata (NFA) wit h
Find £-closure for the foll
epsilon. O, l
e

1
12.
0

e
p 0

13. Wr ite a reg ula r exp res . ge wh ich acc ept s all str ing s
ith atle ast two a's o ver s1onh for the lan gua
b
p· d t e set 1:-
14. lar exp ress ion for the followi~g ;,FA .•
m regu
-

a ,b
Convert th e follo .
wing re g u la r e x
15.
ab b a+ b *. p re ss io n s to NFAs w it h E - tr a n s it io n
s
16. Prove th a t th e c
o m p le m e n t o f a
re g ula r la n g u a g e is a ls o re g u\ a
17. List o u t th e p ro p r•
e rt ie s o f k le e n c
lo su re
18. S ta te P u m p in g L
e m m a fo r re g u la
Derive th e st ri n r L a n g u a g e s.
g "0 0 1 0 1 " fo r ri
S -+ A1B g h tm o st d e ri v a
19. ti o n u si n g a CF
A-+ OA \ E G g iv e n b y ,
B -+ OB 1B E.
20. Define a m b ig u o
u s g ra m m a r a n
d CFG.
PART B / PART
C o n st ru c t th e D C
FA e q u iv a le n c e
l. {q2}) w h e re to th e NFA g iv
6(qo,O) = {qo,q1 e n b y M = ({ q o ,
}, 6 (qo, 1 )= q 1 ,6 (q 1 q1}, { 0 ,1 } , 6 , q
C o o,
2 n st ru
• E-NFA to DFA
c t E-NFA fo r th e
fo ll o w in g e x p re ss
,0 )= <\>, 6 (q 1 ,l )= { q o, q1}
a n d li st th e d if io n (0 1 + 0 * )0 1
E x p la in in d e ta fe re n c e b e tw e e * a n d C o n v e rt th e
il a b o u t Determ n NFA and DF
3 . la n g u a g e a c inisti"C F in it e A A '
c e p ti n g st ri n g s u to m a ta a n d D
= 0, 1 . st a rt in g a n d e n d
in g w it h '0 0 ' o
ra w a D F A fo
r th e
C o v e rt th e g iv e v e r in p u t a lp h a
n a u to m a ta in to b e ts
b m in im iz e d D F A
.S ta rt
4. t.

..
b

5. Myhill Nerod
e th e o rm - Discu
_• M inimize th e fo ll ss th e s te p s w it h
6 o w in g a u to m a to a n e a t s k e tc h
n
 b

ure
7 Explain in detail the properties of kleene clos
reg ular usin g
Pro ve tha t the following language are not
pum pin g Lemma.
8
i. L= {an bn In ~1}
ii. L= { aPI p is a prime}
by examining the derivation of
Illustrate the formation of a derivation tree,
9 the string "001" from the grammar G
wing production rules (P)
Given the grammar G= (V, £, P, SJ with the follo
s ➔ AC I B,
_A ➔ a,
10 C ➔ CI BC,
E ➔ aA[e
Find a reduced grammar equivalent to G

gua ge Lov er inp ut alph abe ts

Con stru ct a min ima l DFA for the lan
*10 0
11 = 0, 1 for the re ular ex ress ion O+ 1

mata.
Construct the minimized DFA for the given auto

12

th
g properties, components wi an
Explain in detail abo ut alphabets and strin .
exam le
13 Josure of each state and find its
£ - c
Consider the following e-NFA. Compute •
14 e uiva lent DFA. •
r
6 £ a b C

->p {q,r} {cp} {q} {r}

q {cp} {p} {r} {p,q}

*r {cp} {cp} {cp} {r}

I
Jt ·
1. Given r= {a, b} construct a DFA which recognize the Ianguage
L= {bm an I m, n>O}.
15 ii. Construct the DFA accepting the language over the alphabet L= {0,1},
where number of l's is a multiple of 3.

Convert the following NFA to a DFA and informally describe the language
it
accepts.
6 0 1
➔p {p,q} {p}
16
q {r, s} {t}
r {p, r} {t}
*s <I> <I>

4
/ *t <I> <I>
1. Design a FA for the RE (0 +1)* (00 + 11)01 .
17
Prove that the language L = { anbn In >O} is not regul ar
Find the regular expression for the following DFA
a
-
00 b
-y
I B
18 J

b a
b

IC

/ Show that the regular language is closed under:

19 a. Union
b. Intersection
c. Kleen closure
d. Complement
20 Writ~ and explain algori thm for minimi7Ation of a DFA Minimize the follow
automaton in
g
r
'

1
0,1

0 0

1 0
i. Solve the follo wing gram mar :
S ➔ aAa I bBb I BB
A➔C
B ➔ SIA
21 c➔s I e
For the strin g "abaabbba". Find left mos t, righ tmo
st deri vati on and
pars e tree .
ii. Sho w that the following gram mar is ambiguous:
s ➔ a s + s s s s•s s .
i. Find out whe ther L= {xny nzn I n>= l} is cont ext free
22 or not.
1. Let L be the lang uage {ww R I we {O, 1} *. Sho w that
this lang uage is not
a CFL.
1. Con stru ct a regu lar exp ress ion den otin g the set
23 of all stri ngs
ove r {a, b} suc h that all star ts with •a• and end
s with "ab "
con stru ct DFA for the sam e.

2. Con stru ct the min imiz ed DFA for the following auto
ma
regu lar expr essi on for min imiz ed DFA.

24

0,1