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