Question

Find (1) an NFA and (2) a regular expression for the following languages on fa, bj. Tb) imo . L-[w: 2na(w) + 3nb(w) is even) Note: na(w) means the number of a's in the string w, and n is defined in the same way.

Please show all steps and work. Thanks

Answer 1

Shigs aecepled the gn bnguage ae en ngu , ab, ba, aaa, abo, abab, baka, bbae b5b aaaaaa, aaabbb Differenie betveen umber of a'r ond not f b's me be dvthbe by 7. elou s the FA f the giveh lapayoge Present state gmbolelstate 41 2. 92 41 10 41 nitial and firal staa is o

2 na tu) 3n, (u) is even Shing ascepled by the gien onguage are a,'bb) aa abb, bab, bba人aabb , abab, ba ba, bbaa b of a'J could be euen or odd No. 0f·B) rour be even the Sun leads to even NFA -1 Initial ard ral state 9 iolal state are g% and 3