11-26-2012, 04:58 PM
CS402 Theory of Automata Assignment No.3 Fall Semester 26th November 2012
Theory of Automata (CS402)
Assignment # 3
Total marks = 20
Deadline Date = Nov 29, 2012
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 file is corrupt.
The assignment is copied.
Strict action will be taken if submitted solution is copied from any other student or from the internet. Students will be punished severely in either case.
1) You should concern recommended books to clarify your concepts as handouts are not sufficient.
2) You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, zip, rar, bmp etc will not be accepted.
3) You are advised to upload your assignment at least two days before the due date.
4) The assignment file comprises of two pages.
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 assignment in the last hour of the deadline. It is recommended to upload solution file at least two days before the deadline.
For any query, feel free to email at:
Q. No. 1 Construct Non-Deterministic Finite Automaton (NFA) from the concatenation of the following two languages:
a. Language of all strings defined over Σ = {0, 1} whose length is even and number of 1’s are odd.
b. Language of all strings defined over Σ = {0, 1} whose second last letter is 1.
Marks [5+5+5]
Hint: First construct FA for the given languages and then construct NFA from their concatenation.
Q. No. 2 Construct a Finite Automaton (FA) for the language of all strings defined over Σ = {0, 1} that ends with substring “01” and have odd length.
Marks [5]
Best of luck
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
