undefined

(10 points) An Easy Warm-Up 1. Let Lo be the set of binary strings that represent numbers divisible by 6. In Lecture 2.5 we built a DFA for Lo and minimized it. Use state elimination, on either the original or the minimized DFA, to get a regular expression for L6. (10 points) An Easy Warm-Up 2. Let X be the language of the regular expression (a + ba*b)*. Using a systematic method (either the one in Sipser or not), create an NFA (possibly with epsilon- moves) whose language is X. Convert this NFA to an equivalent DFA and minimize it. (10 points) An Easy Warm-Up 1. Let Lo be the set of binary strings that represent numbers divisible by 6. In Lecture 2.5 we built a DFA for Lo and minimized it. Use state elimination, on either the original or the minimized DFA, to get a regular expression for L6. (10 points) An Easy Warm-Up 2. Let X be the language of the regular expression (a + ba*b)*. Using a systematic method (either the one in Sipser or not), create an NFA (possibly with epsilon- moves) whose language is X. Convert this NFA to an equivalent DFA and minimize it