Professional Documents
Culture Documents
Total Marks: 80
Time: 3 Hours
EXAMPAIGAD
05
1. (a) Explain Chomsky Hierarchy.
05
(b)Differentiate between PDA and NPDA.
05
- (c)Define Regular Expression and give regular expression for
i) Set of all strings over { 0, 1}that end with 1 has no substring 00
05
(d) Explain Halting Problem.
2. (a) Design a Finite State Machine to determine whether ternary number (base 3) 10
is divisible 5.
b) Give and Explain formal definition of Pumping Lemma for Regular Language and 10
prove that following language is not regular.
L={ a"bm| m>0}
S’iCtS|iCtSe Sla
C’b
55197 Page 1 of 2
86A0798576FOEC29F86CCD3F4386FOAF
DATE:
PAGE:
NAME: STD.: DIV.:
G
Deino ing oer to,r4
en ho n
subtn
Aegulo
chanactts Seanc pocttan
R.E ( of+1 )
33
Stater
qoinitial state
q1-sejectd state 1- acephed
dcceplkd sBate 35
MAF:
92 200 92 ol 92b 2
92
4|1D 912
92
41
42
9242
2 O
L= Samm>o
Slep1 Consid aie o
m=l
lal= 1
m 2
Le ab
labl3
'La2.
Labl- 5
WORLD STAR For Educational Use
DATE:
NAME: STD.: DIV.: PAGE:
Slep2
iat q Ku constant egula Languna
z= K+k-l =2K
2 Can be wLutten a
StepBi By punging- Lemma
Stept Addling Length a lzl
2k+1 s luvw < k+2K
2k < Juvw| < 3K+|
Step S : dat take
2<luwl<4
k2
4< luVw<4
K
One vale we cannot hawe
for
aab
Zo
for
aaaa bb
S’ iC+ SeS
ibtSeS
PbtaeS
ibtae ictS
’ibtaeibts
3Pbtaeb ta
RMO
’ictSeiCtQ
i CtSei bta
’taerbta
ibtaeibta
’Parse Tree leltmot
jC4ses
ietS
Sundaram) FOREDUCATIONAL USE
(ondaram)
iCISe S
PORRDUCATIONAL USE
Sundaram)
R
a) Consruct PDA to check ohere w S Yever ge 0-f w
% C Ts a congtant
S(ab,a)’(4, ba)
S(a2,bb’(a,e)
S(3,a, a ) ’(3, e)
S23,a, a)’(a, e)
bib,
bzo,bz0
o, 20az0
baba b
bib
bbl&2
Ca,a
20,20