diff options
| -rw-r--r-- | mgr.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -87,7 +87,7 @@ f \section{Word infix regular queries} There is a simple and well-known data structure that, given a fixed automaton -$A$, preprocesses an input word $w$ in time $O(n)$, and afterwords is able to +$A$, preprocesses an input word $w$ in time $O(n)$, and afterwards is able to answer in time $O(1)$ questions of the form ``Is the infix $w[i, j]$ accepted by $A$?''. We present the full construction as we will be generalizing its internals for the tree case. |