Question: 4. Let -{a, b). Construct a regular expression defining each of the following lan- guages over . (a) The language of all words that do

4. Let -{a, b). Construct a regular expression defining each of the following lan- guages over . (a) The language of all words that do not end with ab. (b) The language of all words in which any a's that occur are always found in groups of an odd number at a time, such as babbaaaba
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
