Question: *****||NEED HELP WITH B ONLY||***** a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number
*****||NEED HELP WITH B ONLY||*****
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.
(ab | ba) (aa | bb) + (ab | ba)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
