Consider the fiNite-State Automaton Given by the Following Transition Diagram $$\begin{array} { l l l l } 000101 & 0100010 & 000100 & 110001\end{array}$$

question 4

Essay

Consider the finite-state automaton given by the following transition diagram:
(a) To what state does the automaton go if the string 10010010 is input to it? Is this string accepted by the automaton?
(b) Indicate which of the following strings are accepted by the automaton: $$\begin{array} { l l l l } 000101 & 0100010 & 000100 & 110001\end{array}$$
(c) Describe the language accepted by the automaton.
(d) Find a regular expression that defines the same language.