Question: Find a regular expression for the language L = {w E {a, b}*nais even and no is odd}, eliminating the state OO first EE

Find a regular expression for the language L = {w E {a, b}*nais even and no is odd}, eliminating the state OO first EE a b b OE 55 EO 3 e 03 b a b a OO e Q2. Construct the NFA for the language L = {a" bm: n 3, m 3} and give the regular expression.
Step by Step Solution
3.37 Rating (156 Votes )
There are 3 Steps involved in it
b EO Cand 00 9 ad for simplicity take EE as Auz as 93 As it is state should will d Simibaly remainin... View full answer
Get step-by-step solutions from verified subject matter experts
