m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--mgr.tex8
1 files changed, 4 insertions, 4 deletions
diff --git a/mgr.tex b/mgr.tex
index 9463dd2..daae164 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -906,9 +906,9 @@ respect to $W$ is a partition into subtrees, subtrees with holes, and
singletons constructed according to the following rules:
\begin{enumerate}
- \item If $v \in W$ is a maximal in $W$ with respect to the ancestor
- relation $<$ (i.e. there are no other elements of $W$ in the subtree of
- $v$), then the subtree of $v$ is a part of the partition.
+ \item If $v \in W$ is maximal in $W$ with respect to the ancestor relation
+ $<$ (i.e. there are no other elements of $W$ in the subtree of $v$),
+ then the subtree of $v$ is a part of the partition.
\item If $v \in W$ has descendants that are in $W$ only in its left child's
subtree, let $w$ be the highest such descendant (there is a unique
highest descendant because $W$ is LCA closed). The subtree of $v$ with
@@ -1238,7 +1238,7 @@ $\Sigma$ labeled tree $T$.
branch infix regular questions about the language $L_{q, q'}^R$.
\end{enumerate}
-\textbf{answering questions} We receive the question ``for a a tuple of sets of
+\textbf{answering questions} We receive the question ``for a tuple of sets of
$T$'s vertices, $\vec{W}$, does $T \models \varphi(\vec{W})$?''
\begin{enumerate}