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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!