Question: Please provide step-by-step proof; thank you! Prove that no 2-state DFA can decide the language L = { x {0,1} | x is a binary
Please provide step-by-step proof; thank you!
Prove that no 2-state DFA can decide the language L = { x {0,1} | x is a binary number divisible by 3}.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
