Theory of Automata
(CS402)
Assignment # 3(Graded)
Total marks = 20
Deadline Date = July 13, 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:
- 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.
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.
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.1. Develop a Moore machine that
counts number of “bbaa” in any string.
∑ = {a, b} and Г = {0, 1} [Marks 13]
Q.2. Convert above Moore machine into
an equivalent Mealy machine. [Marks 7]
Best of
luck!
Solution
402 Assignment Idea Solution ( Not My Sub)
Q.1. Develop a Moore machine that counts number of “bbaa” in any string.
∑ = {a, b} and Г = {0, 1}
Q.2. Convert above Moore machine into an equivalent Mealy machine.
Soln Idea:
You just need to Read out Lecture 20 and 21 in handouts i hope all of u would be able to get the concept of Moore and mealy machines or more simply copy the transition graph for moore machine given at the beginning of lecture 21, just insert an extra transition 'a' at the end as the given counting string is 'bbaa' instead of bba. after then u just need to draw the Transition table and the mealy machine accordingly.
Here i m sharing the transition table for the given counting string showing output by both moore n mealy machine... Friends draw the transition graph yourself as i hv mentioned :)
∑ = {a, b} and Г = {0, 1}
Q.2. Convert above Moore machine into an equivalent Mealy machine.
Soln Idea:
You just need to Read out Lecture 20 and 21 in handouts i hope all of u would be able to get the concept of Moore and mealy machines or more simply copy the transition graph for moore machine given at the beginning of lecture 21, just insert an extra transition 'a' at the end as the given counting string is 'bbaa' instead of bba. after then u just need to draw the Transition table and the mealy machine accordingly.
Here i m sharing the transition table for the given counting string showing output by both moore n mealy machine... Friends draw the transition graph yourself as i hv mentioned :)
Post a Comment
0 comments
Dear readers, after reading the Content please ask for advice and to provide constructive feedback Please Write Relevant Comment with Polite Language.Your comments inspired me to continue blogging. Your opinion much more valuable to me. Thank you.