See figure attached for problem statement as well as my attempt.

I just want to make sure I fully understand the process of going from a state table to boolean functions for the given flip flops.

Am I correct assuming that everything after 1001 is a don't care state?

Did I obtain my functions for Y2,Y1,Y0 correctly? (They should be the functions representing the input of each D flip flop)

Also, is my K-map to reduce Y2 correct?

I just to reassure myself that I am infact doing things correctly.

Thanks again!

 

His Noodly Appendage has no use for maths.

 

His Noodly Appendage has no use for maths.

I have an exam on this stuff in a few days so I'd love to know whether I'm doing things correctly...

 

Procedure looks fine.

 

The function for Y2 is correct.

If you feel comfortable about the way you filled your K-map, go ahead and use it. If you have doubts about your method, I suggest the following:

You can transform the table by inserting w as a separate column. That will double the number of rows but will make the problem more obvious to solve. Of course any rows that aren't noted on the exercise are a Don't Care.

You can take this state (on step 4) table as a template:
http://forum.allaboutcircuits.com/showthread.php?t=44399