Finite State Automata

• Once you've got a persistent state, all you need is to combine them appropriately to get an FSA.
• A finite state automata has several states and an alphabet of inputs.
• Depending on the current state and the input, you switch to another state.
• The states and the inputs are modelled by persistent sets of neurons.
• Now, connect the states so that the combination of the input and the prior state turns on the next state.
• The next state has to turn off the prior state, via inhibitory synapses.
• In cases where there are bidirectional connections between two states, you need to use intermediate states.
• This will implement a finite state automata.
• There is more sophisticated processing than FSAs, but a lot of processing can be done by them.