diff --git a/info/exercises/ex-01-sol.pdf b/info/exercises/ex-01-sol.pdf
index 93662d1e647e8072f1ab46dc7070f31f9464331d..f44876473069f634e8481a8ecaf348073f1d790c 100644
Binary files a/info/exercises/ex-01-sol.pdf and b/info/exercises/ex-01-sol.pdf differ
diff --git a/info/exercises/src/ex-01/ex/languages.tex b/info/exercises/src/ex-01/ex/languages.tex
index ff0a1fa65a890930f337cb503cac878ec1fb20d2..7cdbda25d4a1be1194601a68fb66adeaae59878b 100644
--- a/info/exercises/src/ex-01/ex/languages.tex
+++ b/info/exercises/src/ex-01/ex/languages.tex
@@ -134,7 +134,7 @@
       such that \(w_1 = a\), \(w_2 = a\), and \(w_{i + 2} = v_i\) for \(1 \le i
       \le m\). Since \(m < |v|\) and \(|v| = |w| - 2\), \(m + 2 < |w|\). QED.
 
-      \item \(w = aab\): by the same argument as the previous case, \(v\) has a decomposition
+      \item \(w = abv\): by the same argument as the previous case, \(v\) has a decomposition
       into words in \(\{a, ab\}\), \(v = v_1\ldots v_m\) for some \(m < |v|\)
       and \(v_i \in \{a, ab\}\).