Question: Find (1) an NFA and (2) a regular expression for the following languages on {a,b} . L = {w : na(w)-nb(w) (mod 3) =0} L

Find (1) an NFA and (2) a regular expression for the following languages on {a,b} . L = {w : na(w)-nb(w) (mod 3) =0} L = {w : 2na(w) + 3n6(w) is even). Note: na(w) means the number of a's in the string w, and is defined in the same way
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
