Question: Problem 15. Prove that no 2-state DFA decides the language A={I {0,1}* | brum(I) is divisible by 3}

Problem 15. Prove that no 2-state DFA decides the language A={I {0,1}* | brum(I) is divisible by 3}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
