Question: Q1- (a) For = {a, b}, Build an FA for language Odd-Odd All words with Odd as and Odd bs. Regular expression(strings containing Odd number
Q1-
(a) For = {a, b}, Build an FA for language Odd-Odd All words with Odd as and Odd bs.
Regular expression(strings containing Odd number of a's and b's):

(b) Find the regular expression corresponding to this Transition Graph (TG). Show all steps (Note: the letter at the loop in 2nd state is 'b')

[aa+bb+(ab+ba)(aa+bb)*(ab+ba)l*(ab+ba)[aa+bb+(ab+ba)(aa+bb)*(ab+ba)l
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
