--- a/hws/hw02.tex	Wed Sep 27 22:42:19 2023 +0100
+++ b/hws/hw02.tex	Sun Oct 01 09:46:44 2023 +0100
@@ -204,7 +204,7 @@
       recognising all strings that do not contain any
       substring $bb$ and end in $a$.
 
-      \solution{$((ba)^* \cdot (a)^*)^*\,\cdot\,a$}
+      \solution{$((ba)^* \cdot (a)^*)^*\,\cdot\,a + ba$ \quad Not sure whether this can be simplified.}
 
 \item Do $(a + b)^* \cdot b^+$ and $(a^* \cdot b^+) +
   (b^*\cdot b^+)$ define the same language?