Chapter 13.4, Problem 14E

Construct a nondeterministic finite-state automaton that recognizes the language generated by the regular grammar $G=\left(V,T,S,P\right)$ , where $V=\left\{0,1,S,A,B\right\},T=\left\{0,1\right\},S$ is the start symbol, and the set of productions is

a) $S\to 0A,S\to 1B,A\to 0,B\to 0$

b) $S\to 1A,S\to 0,S\to A,A\to 0B,B\to 1B,B\to 1$

c) $S\to 1B,S\to 0,A\to 1A,A\to 0B,A\to 1,A\to 0,B\to 1$