Assignment No. 2
SPRING 2013
SPRING 2013
CS402 – Theory of Automata
Instructions
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
o Assignment is submitted after due date.
o Submitted assignment does not open or file is corrupt.
o Assignment is copied (From internet/ to from students).
Objective
To get understanding about Finite Automata, TGs and Kleen’s theorem
Assignment Submission Instructions
Assignment should be submitted in DOC / DOCX format. All other formats (like jpeg / gif / cpp / etc) are awarded as zero without marking.
Assignment Statement
Following are the two FAs, FA1 accepts all words with a double a in them, and FA2 accepts all words ending in b. Build FA3 that accepts all words that have double a or that end in b. Show all steps
Deadline:
Your assignment must be uploaded on or before 15 May, 2013.
0 comments
Post a Comment