Fix typos

Advanced/De Bruijn/parts/4 sturmian.tex

@@ -276,7 +276,7 @@ Attempt the above construction a few times. Is $w$ a minimal Sturmian word?
 
 
 \theorem{}<sturmanthm>
-We can construct a miminal Sturmian word of order $n \geq 3$ as follows:
+We can construct a minimal Sturmian word of order $n \geq 3$ as follows:
 \begin{itemize}
 	\item Start with $G_2$, create $R_2$ by removing one edge.
 	\item Construct $\mathcal{L}(G_2)$, remove an edge if necessary. \par
@@ -315,7 +315,7 @@ Construct a minimal Sturmain word of order 4.
 
 	$R_4 = \mathcal{L}(R_3)$ is then as shown below, producing the
 	order $4$ minimal Sturman word \texttt{11110000}. Disconnected
-	nodes are ommited.
+	nodes are omitted.
 
 	\begin{center}
 		\begin{tikzpicture}
@@ -345,7 +345,7 @@ Construct a minimal Sturmain word of order 5.
 
 \begin{solution}
 	Use $R_4$ from \ref{sturmianfour} to construct $R_5$, shown below. \par
-	Disconnected nodes are ommited.
+	Disconnected nodes are omitted.
 
 	\begin{center}
 		\begin{tikzpicture}
@@ -375,7 +375,7 @@ Construct a minimal Sturmain word of order 5.
 
 
 \problem{}
-Argue that the words we get by \ref{sturmanthm} are mimimal Sturmain words. \par
+Argue that the words we get by \ref{sturmanthm} are minimal Sturmain words. \par
 That is, the word $w$ has length $2n$ and $\mathcal{S}_m(w) = m + 1$ for all $m \leq n$.
 
 \begin{solution}