EECS 303 Mailing List
Re: Homework 4 Question 1

Re: Homework 4 Question 1

From: Robert Dick <dickrp_at_avoiding.spam>
Date: Mon Nov 24 2008 - 19:02:14 EST

> Sorry to keep pestering you with questions, but here goes:
> I remember a lot about how to do the FSM minimization from the example in
> class - but I am fuzzy on parts of it.
> Once we have listed the prime compatibles using the implication chart, and
> are to draw the nodes and connections (with implications if there are any),
> do we ever draw nodes more than once? (e.g., when state X and Y can be
> covered by a single state but that implies YZ, should we draw X twice, once
> connected to Y and once on its own?)

Each node will appear only once, and each will correspond only to a single
state in the original FSM. Then start listing compatibles, starting from the
maximal compatibles and adding subsets when this is necessary in order to
cover a state with reduced implications.

> Or do we just have which cliques we circle show that?

Right, and which grouping you enter into your binate covering table.

> Also, if we can cover several pairs of states but it would give the same
> amount of states whether certain states are paired or left separate, should
> we go ahead and cover the pairs? (I was thinking... yes if it would make
> the FSM's behavior more specified, otherwise it makes no difference?)

In this particular case, no. By leaving more Xs in the final machines, you
may have more opportunity for minimizing the resulting state variable and
output functions.

Best Regards,

-Robert Dick-
Received on Mon Nov 24 18:02:14 2008

This archive was generated by hypermail 2.1.8 : Tue Jan 06 2009 - 18:55:01 EST