Help me check my Automata from given Grammar

Question

My update :

Find Automata for $G = (V, T, S, P)$, where $V = [0, 1, S, A, B]$ and $T = [0,1]$ and $P = \{ S -> 1B, S->0, A->1A, A->0B, A->1, A->0, B->1\}$

Please look at question C

My answer ( c ) :

My question :

1. Did i do it (c) right?
2. As you can see, there are no way to get to S3 (A), so that can i cut down the S3 (A) from the automata?

Answer 1

Your observation is correct. State $s_3$ is not needed.

Also, the answer to $b)$ is not correct as it recognizes the strings $10$, $11$ which are not in the language.