Professional Documents
Culture Documents
TCS MAY - 19 Solved
TCS MAY - 19 Solved
10
(b) Explain the types of Turing machine in detail.
two 10
4. (a) Design a turing machine that computes a function f(m,n)=mtn i.e. addition of
integers.
(b) State and explain pumping Lemma for Context Free Languages. Find out whether 10
the language L= {xy'zn2l} is context free or not.
5. (a) Design PDA for the following language: 10
68476
MAY 2019
Jbesign a beA Cept sthing of
endina aitt the shing
Sstes ehtrg
Accepted)
ehana Acepted)
ending th
oth Accepttd)
Aeeptcl
Pejeated
able
FOREDUCATIONAL USE
DATE:
Slaspam.
Take Valve h
n=|
h=2
Pmphy Z= Uv'w
layth
5Take Vales k
3<uw <S
OUV aysumphio,
OR EDCATIONAL USE
Gundaram)
2aDeenan NEA fex teceqntzing strog tlat
(aa oves
ndr fa?9 cohvet
ahove EA to DFA
Catb)aa
X 4-Cclau SGa&GD
qo A
ABA
B D
DA
do1A
33
1 o11oo/.
46
A
q2doo 22/1o1
q3
C
3
93
42
93
A q2
Ac
gteee
Rema epila
S3oAo<ieL| 68loo
Reme Unwatel
Bss
hoh teiahy
kae ce
bfe tpsito
A
epsb
PS
A will be
vemoelt
Cbtab)
C,blb tab) a
at b btab aa
(atb( b ta, ) ac
REEGAL
DATE
TM that tucha
e cdaihon
ih te
, ), 2
B, E, R,
REEGAL
DATE
REEGAL