Add Bojańczyk citation

1 files changed, 8 insertions, 8 deletions

diff --git a/mgr.tex b/mgr.tex
index d3aa05c..bf59c43 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -386,14 +386,14 @@ automaton we ``don't care'' about the exponential cost of determinizing it.
     j]$ belong to $L$?
 }
 
-This problem has a very elegant \qpoptimal{} solution. We present the full
-construction as we will be generalizing its internals for the tree case in
-Chapter \ref{branchinfix}.
-
-\textbf{preprocessing} We begin by replacing each letter of $w$ with a copy of the set of states of
-$A$, $Q$.  More precisely, we will be working with a graph whose vertex set is
-$\{1, \ldots, |w|\} \times Q$. We will refer to a vertex in the $i$th copy of
-$Q$ labeled with state $q$ as $i.q$.
+This problem has a very elegant \qpoptimal{} solution, as presented by
+\textcite{bojanczyk}. We present the full construction as we will be
+generalizing its internals for the tree case in Chapter \ref{branchinfix}.
+
+\textbf{preprocessing} We begin by replacing each letter of $w$ with a copy of
+the set of states of $A$, $Q$.  More precisely, we will be working with a graph
+whose vertex set is $\{1, \ldots, |w|\} \times Q$. We will refer to a vertex in
+the $i$th copy of $Q$ labeled with state $q$ as $i.q$.
 
 Since $A$ is deterministic, each letter $a \in \Sigma$ can be seen as a function
 $a : Q \to Q$, and we draw these functions as directed edges between successive