FSAs with Binary CAs

• So, FSAs are states with arcs to transition from one state to another.
• To implement this, you need states, and each state can be implemented by a binary CA.
• The start state is turned on, and fires until it's shut off.
• You also need to represent the input alphabet. This can also be done by CAs, one for each element of the alphabet.
• Now, to transitition from one state to another, you can use two input CAs (the current state and the alphabet member).
• The neurons in these binary CAs each have a connection to the next CA state sufficient to ignite it.
• The subsequent state has back connections to the original state, and to the alphabet member. These are inhibitory, and are sufficient to shut those states down.
• That's all that is needed.