1.

Fill the missing blank in the given Transition Table:
Language L= {x = {0,1} |x accepts all the binary strings not divisible by 3}

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png"><img alt="The tabular representation of DFA is Q1" class="aligncenter size-full wp-image-145261" height="81" sizes="(max-width: 394px) 100vw, 394px" src="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png 394w, https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5-300x62.png 300w" width="394"/></a>
B. Q0
C. Q1
D. Q2
E. No Transition
Answer» C. Q1


Discussion

No Comment Found