The alphabet = {a, b, c}

Describe (but do not fully specify or write down) a deterministic finite automaton whose language is = {w e * lw has length at least three and the third-to-last and second-to-last symbols in w are different}. When solving this problem you should make sure that the following questions are an- swered: What information does this deterministic finite automaton need to remember (using its states) in order for its language to be ? (Approximately) how many states does this deterministic finite automaton have? Describe (but do not fully specify or write down) a deterministic finite automaton whose language is = {w e * lw has length at least three and the third-to-last and second-to-last symbols in w are different}. When solving this problem you should make sure that the following questions are an- swered: What information does this deterministic finite automaton need to remember (using its states) in order for its language to be ? (Approximately) how many states does this deterministic finite automaton have