This chapter will visualize the matchings (output or state of the automaton). The stable marriage problem (SMP) seeks matchings between n women and n men which would result in stable pairs, and not lead to divorce or extramarital affairs. We have introduced a graph consisting of nodes which represent matchings on a coordinate, and links between nodes which lead to a stable pair by exchanging a partner between two pairs. With the visualization, regularity and symmetry can be made clear in specific instances of the SMP such as the Latin SMP.