equal
deleted
inserted
replaced
118 (q0) edge [loop below] node[below] {$a$} () |
118 (q0) edge [loop below] node[below] {$a$} () |
119 (q1) edge node[above] {$a$} (q2); |
119 (q1) edge node[above] {$a$} (q2); |
120 \end{tikzpicture} |
120 \end{tikzpicture} |
121 \end{center} |
121 \end{center} |
122 |
122 |
123 \item \textbf{(Deleted for 2017, 2018)} |
123 \item \textbf{(Deleted for 2017, 2018, 2019)} |
124 Given the following deterministic finite automaton over the |
124 Given the following deterministic finite automaton over the |
125 alphabet $\{0, 1\}$, find the corresponding minimal automaton. In |
125 alphabet $\{0, 1\}$, find the corresponding minimal automaton. In |
126 case states can be merged, state clearly which states can be merged. |
126 case states can be merged, state clearly which states can be merged. |
127 |
127 |
128 \begin{center} |
128 \begin{center} |