

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The instructions and requirements for assignment 4 in the cs402: theory of automata course. The assignment involves proving the equivalence of two given finite automata (fas) by computing their product. Students are expected to submit their solutions in .doc format before the deadline and are advised to clarify their concepts using recommended books. Strict actions will be taken against plagiarism.
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Total marks = 20
Deadline Date = July 31, 2015
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.
Strict action will be taken if submitted solution is copied from any other student or from 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 format. Any other
formats like scan images, PDF, zip, rar and bmp etc will not be accepted.
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 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 F 0C 7
L2 c) F 0C 8 (L1 c^ F 0C 7 L2).
Note: All transition tables are required.
Best of luck!