Finite State Automaton with CAs
- It's pretty easy to see how CAs can be used to
implement a Finite State Automata.
- A simple way is that there are CAs for each state, and
the currently active CA is the current state.
- There are also CAs to categorise input.
- When one of those becomes active, they cause a transition
to a new state.
- The neurons for both the current state and the input need to
be active for the new state to ignite.
- There is backward suppression so that the old state is
extinguished.
- We also used variable binding
via short term potentiation to do stacks.
