abroy1231 abroy1231 01-06-2021 Computers and Technology contestada A) Construct NFA accepting a language L = a (ae)*or (iou)*. ∑ = {a, e,i, o,u} b) Convert the above NFA to an equivalent DFA by using "Tabulation Method".
