- The FSA above can be represented by the fLIF net below.
- There is a persistent net for each state.
- In the FSA diagram, there are classes of words that are mapped 1 to many to the words in the alphabet.
- Error states have also been added for the missing inputs.
- Let's walk through the string, a big black cat
- You can see that we end in the final state.
- Now lets try the big the cat.
- You can see this takes us to a sink.
