On Mon, 12 Nov 2001, Jean-Francois Lord wrote:
> Dr, Amaral.
>
> I'm a little confused about this question.
>
> In the slides is says:
>
> "By McCluskey's definition (1959), the number of
> equivalent state assignments is given by:
>
> N1 = ((2^s - 1)! / (2^s - r)! s !)"
>
> So if I plug in the numbers I get N1 = 3, which means there are three
> equivalent state assignments.
>
> In the home work it says:
>
> According to McCluskey, a machine with 4 states has three nonequivalent
> state assignments.
>
> So if there are 3 equivalent and 3 nonequivalent states and 24 possible
> state assignments, what are the other 18 assignments? equivalent or
> nonequivalent?
>
> Are we supposed to enumerate the equivalent, the nonequivalent, or both
> assignments?
You are only suppose to enumerate three assigments that a nonequivalent.
If the numbers that you wrote above are correct, you can think that
there are three bins of state assingments, each bin with 8 states. All the
assignments that are in the same bin are equivalent.
All you have to do is to pick one assignment from each bin.
Cheers,
Nelson
/
\ / / Jose Nelson Amaral - amaral@cs.ualberta.ca
) / ( Associate Professor
/ / \ Dept. of Computing Science - University of Alberta
( / ) Edmonton, Alberta, Canada, T6G 2E8
\ O / Phone: (780)492-5411 Fax: (780)492-1071
\ / http://www.cs.ualberta.ca/~amaral
`----'
This archive was generated by hypermail 2.1.3 : Wed Nov 21 2001 - 15:50:13 MST