We are given a set of n lectures (in no particular order) that are
... When the initial automaton is reduced to a two-state automaton, the transition on the arc gives us the desired regular expression. Thus, L(M) = a*b(aUba*b)* 4. Suppose that L={an : n is prime} is regular. Then, according to pumping lemma, there must be an integer n≥1 such that any string w L with ...
... When the initial automaton is reduced to a two-state automaton, the transition on the arc gives us the desired regular expression. Thus, L(M) = a*b(aUba*b)* 4. Suppose that L={an : n is prime} is regular. Then, according to pumping lemma, there must be an integer n≥1 such that any string w L with ...
