equal
deleted
inserted
replaced
116 to be in completed form, that is have a transition for |
116 to be in completed form, that is have a transition for |
117 every letter from the alphabet.) |
117 every letter from the alphabet.) |
118 |
118 |
119 \solution{ |
119 \solution{ |
120 Before exchanging accepting and non-accepting states, it is important that |
120 Before exchanging accepting and non-accepting states, it is important that |
121 the automaton is completed (meamning has a transition for every letter |
121 the automaton is completed (meaning has a transition for every letter |
122 of the alphabet). If not completed, you have to introduce a sink state. |
122 of the alphabet). If not completed, you have to introduce a sink state. |
123 |
123 |
124 For fun you can try out the example with |
124 For fun you can try out the example without |
125 out completion: Then the original automaton can recognise |
125 completion: Then the original automaton can recognise |
126 strings of the form $a$, $ab...b$; but the ``uncompleted'' automaton would |
126 strings of the form $a$, $ab...b$; but the ``uncompleted'' automaton would |
127 recognise only the empty string. |
127 recognise only the empty string. |
128 } |
128 } |
129 |
129 |
130 \begin{center} |
130 \begin{center} |