An Example Language and FSA

• This is typically explained by an example like the language "A*BC+".
• This means that elements of the language start with 0 or more As, then a B, then one or more Cs.
• One example is AABC, and another is BCCC. There are an infinite number of strings in the language. All finite languages are regular (can be recognised by an FSA).
• An FSA that would recognise this would have states S0, an arc on A from S0 to itself, and arc from S0 to S1 on B, an arc from S1 to S2 on C, an arc from S2 to itself on C. All of the other alphabet transitions would go to a failure state F, which would have an arc to itself on all elements of the alphabet. S2 is the final state.
• The binary CA mechanism would work for all of these things except the S0 A transition to itself (but I think the self correcting inhibitory neurons would work for this.)
• When states transition from and to each other an intermediate state is needed, and then you can slide across in time.