Consider the fiNite-State Automaton Given by the Following Next-State Table $$\begin{array} { l l l l } 0100 & 101 & 1110 & 00101\end{array}$$

Essay

Consider the finite-state automaton given by the following next-state table:
(a) Draw the transition diagram for the automaton.
(b) Indicate which of the following strings are accepted by the automaton: $$\begin{array} { l l l l } 0100 & 101 & 1110 & 00101\end{array}$$
(c) Describe the language accepted by this automaton.
(d) Find a regular expression that defines the same language.