Number of Programs Possible for a 3 bit FSM

[Radoslaw Grymin]

Hello!

I am not sure what Uncle Bob meant when he wrote that for 8 states he has 8 possible transitions in the state machine.
If I write it as a graph i have 8 edges and I can connect them on Binomial[8, 2] = 28 ways.

Even if he think about sequences and if we have sequence of 8 numbered states we can have a sequence:
1 3 2 5 4 8 7 6 And we have 7 possible transitions... between these states (1-3; 3-2; 2-5; ....)

I also don't understand notation 8p8. Is it 8!(8-8)!? Never seen it before.

Best regards,
Radek

[Radoslaw Grymin]

I had a typo, should be: 8!/(8-8)!

--
The only way to go fast is to go well.
---
You received this message because you are subscribed to the Google Groups "Clean Code Discussion" group.
To unsubscribe from this group and stop receiving emails from it, send an email to clean-code-discussion+unsub...@googlegroups.com.
To post to this group, send email to clean-code-discussion@googlegroups.com.
Visit this group at https://groups.google.com/group/clean-code-discussion.

--

Z poważaniem
Radosław Grymin