Question: Question 3 [25%] a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number of a's
Question 3 [25%] a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number of a's and an odd number of b's. b) Is this regular expression equivalent to the DFA from part (a)? Briefly justify your choice. (abba) (aa|bb)+(abba)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
