Automata

1. (10 points) (i) Write a regular expression r for the language L over alphabet {a,b} of all strings of length four or greater in which the leftmost two symbols are the same, but different from the rightmost symbol. (ii) Enter r into JFLAP. (iii) Use JFLAP to determine for each of following ten test strings if we L(r) or w & L(ri): 2, ab, bba, aaaa, baba, bbba, aaaab, ababab, aababbaab, bbbbaabbaa