diff options
| -rw-r--r-- | mgr.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -1058,7 +1058,7 @@ Regular languages are reversible, so we can preprocess $T$ for branch infix regular questions for each language $L_{q, q'}^R$ (where $\cdot^R$ denotes the reversed language). A question about whether the word on the path from $x$ down to $y$ belongs to $L_{q, q'}^R$ is the same as asking if the word from $y$ up to -$x$ belongs to $L{q,q'}$. Note that the number of languages we need to +$x$ belongs to $L_{q,q'}$. Note that the number of languages we need to preprocess for is constant in the size of the tree -- it only depends on the size of the automaton. |