Scribd
Upload
47 views2 pages

C21-0414-CSE2004 - TOC and CD-Assignment-2

This document contains instructions for an assignment on Theory of Computation and Compiler Design. It includes 4 questions related to regular expressions and DFAs. Students are asked to write regular expressions, convert an NFA to a DFA, construct a DFA from a regular expression, and minimize the number of states in a given DFA. The assignment must be submitted by 7:30 PM as a PDF file named with the student's registration number. It is worth a total of 35 marks.

Uploaded by

Divyanshu Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views2 pages

C21-0414-CSE2004 - TOC and CD-Assignment-2

This document contains instructions for an assignment on Theory of Computation and Compiler Design. It includes 4 questions related to regular expressions and DFAs. Students are asked to write regular expressions, convert an NFA to a DFA, construct a DFA from a regular expression, and minimize the number of states in a given DFA. The assignment must be submitted by 7:30 PM as a PDF file named with the student's registration number. It is worth a total of 35 marks.

Uploaded by

Divyanshu Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

:
Name :

Assignment – 2
Programme : B.Tech. (CSE) Semester : FALL 2022-23
Course : Theory of Computation and Compiler Design Code : CSE2004
Faculty : Dr. Chandan Kumar Behera Slot/Class no. : C21-C22-C23/0414
Time : 18th July, 2022 (6 PM- 7:15 PM) Max. Marks : 35
Answer all the Questions. The PDF file name should be your registration number.
Upload your file in MST (Assignment Section) by 7:30 PM.

Q No. Question Description Mark


Write down the regular expression for the language, which can accept the strings
1 starting with 00 and ending with 00. 5

2 10

Convert the above machine into DFA.

3 Construct the DFA for the language for the regular expression 00((0+1)*00)* 10

4 10

Try to minimize the number of states of the given DFA.

Page 1 of 2


Page 2 of 2

You might also like