diff options
| -rw-r--r-- | mgr.tex | 13 |
1 files changed, 12 insertions, 1 deletions
@@ -133,7 +133,18 @@ The construction is as follows: Additionally, in each vertex, we store the index of the next copy of $Q$ in which the path of this vertex's color is broken by a lower color. -\section{Least Common Ancestor via Range Minimum Query} +\section{Generalizing to trees} + +We will now generalize the above construction from regular infix queries on a +word, to ones on a tree. The exact problem we're solving is + +\emph{Given}: a tree $T$ with labels from alphabet $\Sigma$, a deterministic +finite automaton $A$. + +\emph{Queries}: given a vertex $x$ and its descendant $y$, is the word given by +labels on the path from $x$ to $y$ accepted by $A$? + + \section{Highest Black Descendant on Path} |