equal
deleted
inserted
replaced
61 |
61 |
62 where the three dots stand for arbitrary characters, but not comment delimiters. |
62 where the three dots stand for arbitrary characters, but not comment delimiters. |
63 (Hint: You can assume you are already given a regular expression written \texttt{ALL}, |
63 (Hint: You can assume you are already given a regular expression written \texttt{ALL}, |
64 that can recognise any character.) |
64 that can recognise any character.) |
65 |
65 |
66 \item Geven the alphabet $\{a,b\}$. Draw the automaton that has two states, say $q_0$ and $q_1$. |
66 \item Given the alphabet $\{a,b\}$. Draw the automaton that has two states, say $q_0$ and $q_1$. |
67 The starting state is $q_0$ and the final state is $q_1$. The transition |
67 The starting state is $q_0$ and the final state is $q_1$. The transition |
68 function is given by |
68 function is given by |
69 |
69 |
70 \begin{center} |
70 \begin{center} |
71 \begin{tabular}{l} |
71 \begin{tabular}{l} |