is this transition are right?

Question

Answer 1

Considering the expression 0*(10+1)*

We get the transition table:

State	0	1
A	A	BC
BC	B	B
B	--	B

Now, the thing thats incorrect with your DFA is its accepting 0100 which isnt in the reguar expression.

Now, considering the expression 0*(1+ 0*) = 0*1 + 0*0* = 0*1 + 0*

This simply has 2 states. 

1st state on input 0 goes to itself and on 1 goes to 2nd state. Kepp both states final.

Now, considering your 0*1*01*, we get following transition table:

	0	1
A	AC	B
AC	AC	BC
B	C	B
BC	C	BC
C	--	C

Keep AC,BC,C as final states.

Comments

what abut last one?

---

what is better way to  draw transition diagram with 100% accuracy?

---

last is same as first.

 

To draw accurately, draw NFA/NFA-$\epsilon$ for complex regex and then convert to DFA