Construct a DFA that accepts all strings W over {0,1} such that number of
1’s in W is 3 mod 4.
Answers
Answered by
0
Answer:
IDKKK
Explanation:
IDKKK
Similar questions