Nov Qol19

-Dc
[This question paper contains 7 printed pages)
Your Roll No.

SI. No. of Q. Paper :7407 J

Unique Paper Code :3234 1502

Name of the Course : B.Sc.(Hons.) Computer
Science

Name of the Paper :Theory of Computation

Semester :V

Time : 3 Hours Maximnum Marks : 75

Instructions for Candidates :

(a) Write your Roll No. on the top immediately
on receipt of this question paper.
(b) All questions in Section-A are compulsory.
(c) Attempt any four questions from Section
B.
(d) Parts of a question must be answered
together.
(e) Assume alphabet E- (a,b} unless stated
otherwise.
TO
7407

Section -A

la) Do the following regular expre ssione

1.
represent the samne language (give reason):
2

R,- (a + blla + b))* a

R- (a + b)((a + b)(a + b))'a
(b) Write a regular expression and build a
deterministic finite automata for the
language containing all strings having a at
every odd position. 2+3

(c) Describe in English the languages

represented by the following regular
expressions : 2+2

() b'ab'ab'ab* ++b'ab'ab* xtrl ly ci i

(ii) (a + b)*aa ( a+ b)*
(d) Describe pumping lemma for regular
languages.
(e) Based on the language S = (aa, ba, ab, bb.
describe the language S*,
2
 7407

() What are the languages generated by the

following grammars : 3+3
(i) S ’ XA
X’aXb|A
A’aA IA
(ii) S ’ AB
ab?
A’aA |A
B >bB|A
(g) Show that the following CFG is ambiguous :
3
S ’Xa X
X’ a X|bX IA
(h) Describe the language (in English) accepted
by the following PDA : 3

START REJECT
a,A

b
ACCEPT READ PUSH a READ READ

b
b
b, A
REJECT4 POP
b
a

a, b A
POP READ

ACCEPT REJECT

PTO.
7407
Describe the halting problem. 3
(i)
Let M-(K, E,8, s, (h), where
G)
K(q.q,,h)
E fa,b, U,º)
S
the following table:
and Sis given by
S(g, o)
(9,, b)

b (g,, a)
(h, U)
eutput
Go
(Go --’)
( , sbba ab)

b
 T407

Section -B

2. (i) Let L-Al strings that end with aa or bb.

Construct DFAs for Land L' (6.e., Complernent
of L). 6

(ii) Is the language (abm ; m>0} regular? Justify

using Pumping Theorem. 4

3. (i) Build an FA accepting the language

comprising of all strings having first twO
characters samne as the last two.
6

(ii Convert the foliowing Transition Graph (TG}

into regular expression using Bypass
aigorithm.

(a) ob ba )
 7407

Context Free Grammar (CFG) for the

4. (i) Give
5
following language :
Sasc
2- (a,b,c}
{a'b'ck | i+j= k; i, j, k > 0} and
Sbsc Build pushdown automation (PDA)to accept
(ii)
S the following language :
5

of onlya's, n=length(S),
at! DA {Sba*l; S is a string
nl}
5
the following CFG to CNF:
5. (i) Convert
’E +E
E
E *E
aped
E ’
E ’ (E)
E’6|7
terminals here are + *( 067.
The
recursive languages are closed
(ii) Prove that the 5
under complementation.
Machine that scans to the
(i) Design aTuring consecutive a's and
6. finds two Turing
right until itThe alphabet of the 5
then halts. fa, b,U, A}.
machine should be closed
context-free languages 5
(ii) Prove that and concatenation.
under Union
 7407

7 (i) Build FA for each of the following regular

languages L,and L,. 4
L= ba+b)* L, a(a+b)*b + bla+b)*a
(ii) Build FA for L,N L,. 4

(ii) Describe in English the language

represented by L,nL, 2

L
b

b(atb) *a

7 1300