So far we have been dealing with Fa's over the alphabet. {a, b}. Let us consider for the moment the alphabet ∑ - {a, b, c}.
(i) If we had an FA over this alphabet with five states, how many entries would there be in the transition table?
(ii) In the picture of this five-state machine, how many edges would need to be drawn in total (counting an edge with two labels double and an edge with three labels triple)?
(iii) Build an FA that accepts all the words in this alphabet that have an a in them somewhere that is followed later in the word by some b that is followed later in the word by some c (the three being not
necessarily in a row but in that order, as in abaac).
(iv) Write a regular expression for the language accepted by this machine.