Total No. of Questions :10] SEAT No.

8
23
P3635 [5560]-591
[Total No. of Pages : 3

ic-
T.E. (I. T.)

tat
1s
THEORY OF COMPUTATION

0:0
(Semester-I) (314441) (2015 Pattern)

01 91
3:3
0
91
Time : 2½ Hours]
3/0 13 [Max. Marks : 70
0
Instructions to the candidates:
5/2
.23 GP

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8, Q9 or Q10.

2) Neat diagram must be drawn wherever necessary.
E
80

3) Figures to the right indicate full marks.

8
C

23
4) Assume suitable data if necessary.

ic-
16

tat
8.2

1s
Q1) a) Design FA that rear string made up of letters in the word ‘CHARIOT’
.24

0:0
and accept those string that contain ‘CAT’ as a substring. [5]
91
49

3:3
b) Find out the regular Expression from given transition diagram (FA) by
30
91

using Arden’s theorem. [5]

01
01
5/2
GP
3/0
CE
80

8
23
.23

ic-
16

tat
8.2

1s
.24

0:0
91
49

3:3
30
91
01
01

OR
5/2
GP

Q2) a) Show that L = {0i1i | i ≥ 1} is not regular, by using pumping lemma. [6]
3/0

b) Define - (i) Language- [4]

CE
80

With an
.23

Example- (ii) Regular Expression

16
8.2
.24

1
49

[5560]-591 P.T.O.
Q3) a) Find out the CFG From given language “ L cantains the strings consisting

8
of a’s and b’s with at least two a’s” . [2]

23
ic-
b) Find the CFL associated with given CFG. [3]

tat
S → a A /1/B

1s
A → 1B /1

0:0
01 91
B → 0A/0

3:3
0
91
b) Convert the following grammar into (CFF).
3/0 13 [5]
S → ABA
0
5/2
.23 GP

A → a A/∈
B → b B/∈
E
80

8
C

23
OR

ic-
16

tat
Q4) a) Write a short Note on Chansky Hierarch with an example. [4]
8.2

1s
.24

b) Check whether the following grammar is ambiguous or Not, if it is

0:0
91
ambiguous, remove the ambiguity & write an equivalent ambiguous
49

3:3
grammar. [6]
30
91

S → iCts/iCtsCS
01
01

C → b, S → a
5/2
GP
3/0
CE
80

Q5) a) Construct PDA for following language. [8]

8
23
.23

L = { 0n1m 2n | n, m > = 0}
ic-
16

tat
b) Design post machine for language. [8]
8.2

1s

L= { an bn | n ≥ 1 }
.24

0:0
91

OR
49

3:3

Q6) a) Obtain PDA for given grammar [10]

30
91

S → a ABC
01
01
5/2

A → aB|a
GP
3/0

B → bA|b
CE
80

C→a
.23

Design PDA for following language.

16

b) L = { an bn cm dm | n, m > = 1} [6]
8.2
.24

2
49

[5560]-591
Q7) a) Design a TM that multiplies two unary. [10]

8
23
numbers over Σ = { a }

ic-
Write simulation for (i) aa & aaa

tat
1s
(ii) aaa & aaa

0:0
b) Explain the halting problem in TM. [8]

01 91
3:3
0
91
3/0 13 OR
0
Q8) a) Construct TM for the language. [10]
5/2
.23 GP

L = { an bn cn | n > 0 }
E
80

show simulation for (i) aabbcc (ii) abbccc

8
C

23
b) Compare FM , PDA, PM, & TM with respect to language grammar ,

ic-
16

powerfulness and example. [8]

tat
8.2

1s
.24

0:0
Q9) a) Prove that following are decidable languages. [10]
91
49

3:3
i) ACFG= { ( G, W) | The context sensitive grammar G accepts the
30

input string W}.

91
01
01

ii) ADFA = { ( B, W) | B accepts the input string W}

5/2
GP

b) Prove that pcp with two lists x = (01, 1, 1)

3/0

y = ( 012, 10, 11) has no solution. [6]

CE
80

8
OR

23
.23

ic-
16

tat
Q10) a) Show that HALT TM={ (M, W) | The turing Machine M holts on input W} is
8.2

1s

undecidable. [8]
.24

0:0

b) Prove that “ It is undecidable whether a CFG is ambiguous”. [8]

91
49

3:3
30
91
01
01
5/2
GP
3/0
CE
80

[[[[
.23
16
8.2
.24

3
49

[5560]-591