diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-06 14:28:32 -0400 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-06 14:28:32 -0400 |
commit | c06424befd41a214720f2b746e83445e93bf917e (patch) | |
tree | bd8e0082cc8eb2a7e60da2e792096eee4222a777 | |
parent | 74019ab472c3abc66b0b2fc1f88c56b315694eb7 (diff) |
Fix typo
-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. |