Question: Draw for Automata Theory please. 3. Construct a DFA that accepts the language L={w:Na(w)mod3=1}, where Na(w)=No. of a s in string w. Note that ={a,b}
Draw for Automata Theory please.

3. Construct a DFA that accepts the language L={w:Na(w)mod3=1}, where Na(w)=No. of a s in string w. Note that ={a,b} - 4 points
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
