Learning Functional Programming in Go

Finite state machines

Can we assume that the finite state machines (FSMs) of our system exist within our groupings? (Where the FSM would be like the A and B groupings that we looked at previously.)

Let's imagine systematically decomposing our FSMs into the smallest possible components.

Starting with our context component C, by observing behavior/morphisms and applying the Schreier Refinement Theorem and what we know about isomorphism, can we systematically decompose a large FSM into a grouping of the smallest possible FSMs of equivalent behavior?

Here's the first decomposition:

Here's the second decomposition:

We have been wiring up our ...