Reply
Sat 1 Apr, 2006 12:29 am
Hi, currently doing a sequence question and my textbook don't have much explaination about this question, hope experts from able2know can guide me the method of looking to this question. Thanks so much.
What sequence of bits will be detected by the following state machine?
(The output will change from 0 to 1 whrn the right sequence appears on the input)
a. 0,0,1,1
b. 0,0,0,1,1
c. 1,1,0,1,0,1
d. 0,1,0,1
e. 0,1,0,0,1
Each state has two exits: one for when the input is 0 and one for when the input is 1. Also, the output is modified on each state transition.
The transitions are labeled (I/O). When the input matches I, that path is taken to the next state and O is output.
For example, if the input were
1,0,1,0
The first transition would be from state A to state A, and the output would be 0.
The second transition would be from state A to state B, and the ouput would be 0.
The third transition would be from state B to state C, and the ouput would be 0.
The final transition would be from state C to state D, and the output would be 0.
Obviously, this example isn't recognized by the state machine.
Hi, thanks markr. Yes, I notice that each state has two exits: one for when the input is 0 and one for when the input is 1.
I would like to know what is the meaning "The output will change from 0 to 1 when the right sequence appears on the input" on this question. Please guide me some informations. Thanks
In the example I gave, the output of each state transition was always 0. You've found the answer when the output changes from 0 to 1. If you'll notice, there is only one state transition that outputs a 1.
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace