--- a/hws/hw03.tex	Thu Oct 05 10:31:05 2023 +0100
+++ b/hws/hw03.tex	Thu Oct 05 14:36:54 2023 +0100
@@ -118,11 +118,11 @@
 
       \solution{
         Before exchanging accepting and non-accepting states, it is important that
-        the automaton is completed (meamning has a transition for every letter
+        the automaton is completed (meaning has a transition for every letter
         of the alphabet). If not completed, you have to introduce a sink state.
 
-        For fun you can try out the example with
-        out completion: Then the original automaton can recognise
+        For fun you can try out the example without
+        completion: Then the original automaton can recognise
         strings of the form $a$, $ab...b$; but the ``uncompleted'' automaton would
         recognise only the empty string.
       }