construction?

14.

machine
techniques for Turing
(il
t-' State the
fllustrate with a simple language'
(10)
models of Turing machines'
different
the
04 Explain
,._.,
or

(a)

(b)

r,,,,.t''',
CFL? state th'e*ifi$'&..r
of
properties
what are the closure

td
t''

$r,

l:,,
,';i
..:r-.:;;i:e,,-,.
t*o prop"rti"".
'sfi+ry*ffiatn
cFL+'
for
lemma
(u)
1-' state the Pumping
::t-*#
-

application? Give two

15.

(a)

({

examples'

(iil ktl,={o'a}* '

ui'*''""'"'-

:i

'l

tQl tSb halting

(8}
over {t:TF ae unsavafrei

of
$tate t}re halting problem
problem orruringnrrLhine

':"

T}vIs'

l'

*t*A*

',,r,,,,,,,,,,,,,,".,,;l'

.
given
ttrree"'Strings as
of
lists
he
B
l'et'Aand

below:
3, ba\ B = \b3,.,,b&."d+,r,:::.,:::,:::::...
ansm'er'(8)
'
Jotodo"a Justiff Yow
otFCP&*
instance
this
Does
" -. :A = b,

=w:,,,.,,.'

bab

(8)

.S*
(4

(8)

(ii)

-a'r..1i:-la!,:'il:.:'i;it'..*,,.
ri::::.

::::

ti.i

*,r,,:l!:
.

r;Ir:i:...

:i,:,
i!:

'";;::

':r,....,:,r'
,:,::,,

t?

':t:tr.:,.

.,,

::''

662AL
3