Question: Suppose E = {a,b}. Consider the set of strings W E * such that w has length 1 (mod 3). That is w] = 3n

Suppose E = {a,b}. Consider the set of strings W E * such that w has length 1 (mod 3). That is w] = 3n + 1 for some non-negative integer n. Draw a DFA to recognize this language. Explain your design in 1-2 sentences
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
