Question: 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

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. Enter r into JFLAP. Use JFLAP to determine for each of following ten test strings if We L(ri) or w & L(ri): 2, ab, bba, aaaa, baba, bbba, aaaab, ababab, aababbaab, bbbbaabbaa
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
