 |
|
#1
12-18-2011, 10:15 PM
|
||||
|
||||
CS402 Theory of Automata ASSIGNMENT NO.3 Solution
CS402 Theory of Automata ASSIGNMENT NO.3 Solution
otal Marks= 20 (5+5+5+5) Assignment Submission Deadline Your assignment must be uploaded before or on 22nd of December, 2011 [upload your assignment well before due date to avoid any assignment uploading related issues]. Rules for Marking It should be clear that your assignment will not get any credit if: The assignment is submitted after due date The assignment is copied Objectives Objectives of this assignment are to make students able to understand the following concepts, Moore machine Mealy machine Equivalence of Moore and Mealy machines Assignment No.3 Question No.1 Convert Moore machine given below in corresponding Mealy machine. Run string abbbba on this machine and corresponding Mealy machine by showing complete process and confirm that both machines generate same outputs (ignoring extra character of Moore machine). Question No.2 Convert following Mealy machine into corresponding Moore machine. Run string bbaaba on this machine and corresponding Moore machine by showing complete process and confirm that both machines generate same outputs (ignoring extra character of Moore machine). You can view the demo video in file,http://vulms.vu.edu.pk/Courses/CS402...gnment1.00.zip to see how to make Moore and Mealy machines in MS Word. Assignment Uploading Instructions: Upload single word file having solutions for all parts. 
|
|
Linear Mode
