Consider the ﬁnite-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 deﬁnes the same language.

Question

Consider the ﬁnite-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 deﬁnes the same language.

Quizplus · Accepted Answer

The Answer is a.
$a. b. The strings 101 and 1110 are accepted by the automaton. The strings 0100 and 00101 are not accepted by the automaton. c. The language accepted by the automaton is the set of all strings of 0's and 1's that start with a 1 and contain at least one more 1 . d. 10 ^ { * } 1 ( 0 \mid 1 ) ^ { * }$

b. The strings 101 and 1110 are accepted by the automaton. The strings 0100 and 00101 are not accepted by the automaton.
c. The language accepted by the automaton is the set of all strings of 0's and 1's that start with a 1 and contain at least one more

1 .

d.

10 ^ { * } 1 ( 0 \mid 1 ) ^ { * }

Consider the ﬁNite-State Automaton Given by the Following Next-State Table 0100101111000101\begin{array} { l l l l } 0100 & 101 & 1110 & 00101\end{array}0100​101​1110​00101​

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