Figure 1
From: Local structure supports learning of deterministic behavior in recurrent neural networks
Abstract graphical representation of an example finite automaton (A) and corresponding neural implementation (B). The dotted boxes represent Winner-Take-All circuits in which only one population is active at a time. The populations labeled x represent the states while the populations labeled y implement the conditional transitions between states. The colored connections are learned during training.