Fix typos

pomdps/intro.qmd

@@ -589,7 +589,7 @@ $$
 @Smallwood1973 presented a "one-pass" algorithm to recursively compute $I_t$ and 
 $\{ A^i_t \}_{i \in I_t}$ which allows us to exactly compute the value
 function. Various efficient refinements of these algorithms have been
-presented in the literature, e.π., the linear-support algorithm
+presented in the literature, e.g., the linear-support algorithm
 [@Cheng1988], the witness algorithm [@Cassandra1994], incremental pruning
 [@Zhang1996; @Cassandra1997], duality based approach [@Zhang2009], and
 others. See [https://pomdp.org/](http://pomdp.org) for an accessible introduction to these algorithms. 

references.bib

@@ -2521,6 +2521,20 @@ @Book{Topkis1998
   isbn      = {9780691032443},
 }
 
+@Article{Trench1999,
+  author    = {Trench, William F.},
+  title     = {Invertibly convergent infinite products of matrices},
+  journal   = {Journal of Computational and Applied Mathematics},
+  year      = {1999},
+  volume    = {101},
+  number    = {1–2},
+  pages     = {255--263},
+  month     = jan,
+  issn      = {0377-0427},
+  doi       = {10.1016/s0377-0427(98)00191-5},
+  publisher = {Elsevier BV},
+}
+
 
 @Article{Tsitsiklis1984,
   author    = {John N. Tsitsiklis},

rl/stochastic-approximation.qmd

@@ -325,7 +325,7 @@ Consider a continuous function $f \colon \reals_{\ge 0} \to \reals_{\ge 0}$.
 
 * The function $f$ is said to belong to class $\mathcal K$ if $f(0) = 0$ and $f(\cdot)$ is strictly increasing.
 * The function $f \in \ALPHABET K$ is said to belong to class $\ALPHABET K \ALPHABET R$ if, in addition, $f(r) \to ∞$ as $s \to ∞$. 
-* The function $f$ is said to belong to class $\ALPHABET B$ if $f(0) = 0$ and, in iaddition for all $0 < ε < M < ∞$, we have
+* The function $f$ is said to belong to class $\ALPHABET B$ if $f(0) = 0$ and, in addition for all $0 < ε < M < ∞$, we have
   $$
   \inf_{ε \le r \le M} f(r) > 0.
   $$