Q7-Equivalent Abstract Regular Expressions Not matching this time, just multiple choice: Which regexp[s) are equivalent to a(a BaB+)? iMultiple answers: You can select more than one option Easier finish with 3 questions worth 1 point each. TopHat treats True/False as a binary-choice problem with just one correct answer But simple True/False is silly when the whole HW is configured to allow 2 tries. So this is double True/False, where there's a related option C and you have to select it too if it is true, else not. The A-B item here is: If you reverse every arc in a DFA, you always get another DFA. Multiple answers: You can select more than one option O A True O B False When you do reverse the arcs then two arcs that were on the same char into the same state become nondeterminism. O C Same rules: choose one of A/B then decide whether to add C too. This one is: If L has a DFA with 5 states, then so does the complement of L Multiple answers: You can select more than one option O A True O B False O CIf L has an NFA with 5 states then the complement of L has a DFA with 5 states Q10-Double True/false If the language L(M) of a DFA M is infinite, then M has a "golden state"-meaning an accepting state with all arcs going back to itself. iMultiple answers: You can select more than one option O A True O B False O CIf a golden state is reachable from the start state of M then L(M) is infinite