Scribd
Upload
372 views

Assignment No2 CS402

This document provides instructions for Assignment #02 in Theory of Automata (CS402). It outlines rules for marking, submission format, topics covered in the assignment, and contact information. Students are asked to construct regular expressions and transition graphs/generalized transition graphs defining specific languages over the alphabet {0,1}. Late submissions and plagiarized work will not receive credit. Students should review recommended books to clarify concepts as handouts are not sufficient.

Uploaded by

muhammad waqas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
372 views

Assignment No2 CS402

This document provides instructions for Assignment #02 in Theory of Automata (CS402). It outlines rules for marking, submission format, topics covered in the assignment, and contact information. Students are asked to construct regular expressions and transition graphs/generalized transition graphs defining specific languages over the alphabet {0,1}. Late submissions and plagiarized work will not receive credit. Students should review recommended books to clarify concepts as handouts are not sufficient.

Uploaded by

muhammad waqas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Theory of Automata (CS402) Total marks = 20

Assignment # 02
Fall 2020 Deadline
W S STUDIO 16th Dec, 2020
MUHAMMAD WAJID

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING


It should be clear that your assignment would not get any credit if:
 The assignment is submitted after the due date.
 The submitted assignment does not open or the file is corrupt.
 Strict action will be taken if the submitted solution is copied from any other
student or the internet.

You should concern the recommended books to clarify your concepts as handouts are not
sufficient.

You are supposed to submit your assignment in Doc or Docx format.


Any other formats like scan images, PDF, Zip, Rar, Ppt, and Bmp, etc will not be accepted.

Topic Covered:
The objective of this assignment is to assess the understanding of students about:
 The concept of languages
 Regular Expressions
 Transition Graphs
 Generalized Transition Graph
 Finite automata.

NOTE

No assignment will be accepted after the due date via email in any case (whether it is the
case of load shedding or internet malfunctioning etc.). Hence refrain from uploading
assignments in the last hour of the deadline. It is recommended to upload the solution file
at least two days before its closing date.

If you people find any mistake or confusion in the assignment (Question statement),
please consult with your instructor before the deadline. After the deadline, no queries
will be entertained in this regard.

For any query, feel free to email at:


[email protected]
Question No 1:
Marks:5+5=10
Construct a regular expression and Transition Graph defining the following language over
∑={0,1}:
Solution
R.E=00(00)*1(11)*

All words starting with an odd length of zeros followed by an even length of ones at the end.
Question No 2:
Marks:5+5=10
Construct a regular expression and Generalized Transition Graph (GTG) defining the following
language over ∑={0,1}

All words that end with 000 or 1010.

SOLUTION
R.E=(0+1)*(000)+(1010)
FA

You might also like