diff options
| -rw-r--r-- | mgr.tex | 7 |
1 files changed, 3 insertions, 4 deletions
@@ -1003,12 +1003,11 @@ automaton, allowing us to use our result from Chapter \ref{branchinfix}. To show this formally, consider the alphabet $\Sigma' := Q \times \Sigma \times Q \times \{ \leftsymbol, \rightsymbol \}$. A word over this alphabet can be used to represent a subtree with a hole. A subtree with hole as described above would be -represented by word $a_0 a_1 \ldots a_p$ where +represented by word $a_0 a_1 \ldots a_p$ with each $a_i$ being a quadruple +from $\Sigma'$, $\langle p_i, b_i, q_i, d_i \rangle$ (with $p_i, q_i \in Q$, +$b_i \in \Sigma$, $d_i$ either $\leftsymbol$ or $\rightsymbol$) where: \begin{itemize} - \item Each $a_i$ is a quadruple from $\Sigma'$, $\langle p_i, b_i, q_i, d_i - \rangle$ (with $p_i, q_i \in Q$, $b_i \in \Sigma$, $d_i$ either - $\leftsymbol$ or $\rightsymbol$). \item $b_i$ is the original label of $x_i$. \item $p_i$ and $q_i$ are the states of $x_i$'s children in the precomputed run of $A$ over $T$. |