CS402 Assignment No 4 Solution & Discussion Due Date Jul 31, 2015
Theory of Automata (CS402)
Assignment # 4(Graded)
Total marks = 20
Deadline Date = July 31, 2015
Please carefully read the following instructions before attempting assignment.
Rules for Marking
It should be clear that your assignment would not get any credit if:
1) You should concern the 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 and bmp etc will not be accepted.
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 deadline. It is recommended to upload solution file at least two days before its closing date.
For any query, feel free to email at:
Q. Prove the equivalence of the given two FAs by computing (L1 Ç L2c)È (L1c Ç L2).
Note: All transition tables are required.
Best of luck!
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)