From c06424befd41a214720f2b746e83445e93bf917e Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Fri, 6 Aug 2021 14:28:32 -0400 Subject: Fix typo --- mgr.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/mgr.tex b/mgr.tex index b042360..3f67620 100644 --- a/mgr.tex +++ b/mgr.tex @@ -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. -- cgit v1.2.3