Total No.

of Pages: 4

FACULTY OF TECHNOLOGY
UNIVERSITY OF DELHI
B.E- (5th Semester -Computer Engineering / 7th Semester-ICE)
End Semester Examination December 2020
CEC15 – Theory of Computation

Max. marks – 50
Time: 3 Hrs (for Writing Answers) + 1 Hr (Download Question Paper, Scan & Upload Answer
Script)

Note:

● Attempt all questions.

● Student should write their Name, Roll No., name and code of subject, class and
section on the first page of the answer sheet.
● Students must answer the questions in the same order as listed in the question
paper.
● Students must use A4 size sheets to write the answers and must number each
page at Top Right Corner in a clearly readable form. Each of the A4 size sheet
used must be signed by the student at the Bottom Right in a clearly readable
form.
● Students must scan all the pages of their hand written answer scripts, duly filled
undertaking form and copy of admit card using a scanning App (like Adobe
Scan) to create a PDF file. Students must upload this PDF file on the Google
classroom.
● After uploading their answer script, Students must scan all the pages used for
rough work in a separate PDF file and keep it ready with them so as to submit
immediately to the ERC when asked. Students should retain the physically
written answer script pages & rough work pages securely. The students may be
required to submit these to ERC after the university gets opened for physical
presence of the students.
● Missing data / information, if any, maybe suitably assumed & mentioned in the
answer.
S no. Question Marks

1. a. Find DFA that accepts set of all strings on ∑={x, y} starting with 3
prefix xy
b. Consider the following NFA transition table. Convert the given
NFA to minimum state DFA showing all the steps. 7

State 0 1

!A A A, C

B D C, D

C E ----

*D E ----

*E --- ---

2. a. Convert the following Moore machine to Mealy machine 3

Present state Next State Output
a=0 a=1
!A B C 1

B D C 0

C C B 1

D A D 1

b. Write a case study description about the implementation of Theory 7

of Computation and Automata in any real application scenario.

3. a. Design Context free grammar for aibncn where n≥1 and i≥0 3
b. Convert the given grammar to CNF. Show all the steps.
7
X!AXA|bA
A!B|X
B!c

4. a. Prove that (1+0)*=1*(01*)*. Show all the steps. 3

 b. For L={ambn|n<m} Construct CFG for L, a PDA accepting L by 7
empty stack and a PDA accepting L by final state.
!
5. a. Prove that a set L={ 𝑎! } is not regular using Pumping lemma. 3
Show all steps

b. Design a Turing machine that accepts {1n2n3m|n≥1, m≥0} and 7

show moves for the input 11223
 UNDERTAKING
I, Mr. / Ms. _________________________________ (Roll No.:
__________________________), do hereby undertake that I have not copied/talked to the
another student or to any unauthorized person inside or outside my house/residence during
the examination hours. If I am found to have practiced the same, my examination in this
course may be cancelled.

Course Code : _________________________

Course Name : _________________________

Name : _________________________

Roll No. : _________________________

Signature & Date : _________________________