Poll 5
- Due Sep 9, 2024 at 1:45pm
- Points 12
- Questions 2
- Available Sep 9, 2024 at 1:25pm - Dec 14, 2024 at 11:59pm
- Time Limit None
- Allowed Attempts 3
Instructions
As promised, the poll for your readings are going to be on these topics.
- When you want a DFA for all inputs fed MSB first , i.e. after seeing 100 so far, when bit b=1 arrives, the number becomes 1001. Thus the value of "4" in decimal (corresponding to 100) changes to the value "9" (corresponding to 1001). The update rule for the state is which one? (A few choices listed.). Assume that we want to accept all inputs modulo 7.
- If you want a DFA for "does not begin with 0101 AND does not end with 0011" , would you design it as such or would you apply DeMorgan's Law to the language specification? If the latter, what would the approach be?
Only registered, enrolled users can take graded quizzes