Question: 5 . Consider the language L = { w in { 0 , 1 } | | w | is not divisible by 3 }

5. Consider the language L ={w in {0,1}||w| is not divisible by 3}.(a) Give the state diagram of an NFA recognizing L that has exactly one accept state.
(b) Prove that every DFA recognizing L requires at least two accept states.

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!