Regular Expression to DFA

Question

Having hard time , to understand why (A) isn't the answer ? Looking at DFA it looks , 2* is good starting state ; then there are two paths 0 first path good enough ; for second path 1 is necessary what about 2 ; shouldn't it be 2* as it's 0 or more occurences.

Am I solving it wrong ? Is this incorrect approach to look at the question ?

Answer 1

see, option A can produce 2 0 1 2 as a string from it's regex. but if you provide the input to this machine it will go to q0 -->( on 2) -->q0 -->(on 0) -->q1 -->(on 1) -->q1-->(on 2)-->is not defined.

but option B, C, D can not produce this string. so A is wrong option.

Comments

no but 2 0 1 2 is accepted by this automata on 2 -----q₀ on 0 q_1--------  on 1 q2 and on 2 q₂

Answer 2

1.question is wrong 

it is not a DFA

there is two q₀ state and intial state is not given

2.there is no symbol is given on the transition from q₃ to q₄