From 112232de666efd87c5e7dbf05efa277564cea204 Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Fri, 6 Aug 2021 14:28:54 -0400 Subject: Stylistic change --- mgr.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'mgr.tex') diff --git a/mgr.tex b/mgr.tex index 3f67620..cf7bb8b 100644 --- a/mgr.tex +++ b/mgr.tex @@ -92,8 +92,8 @@ 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. -Suppose $A$ is deterministic. We begin by replacing each letter of $w$ with the -set of states of $A$, $Q$. +Take $A$ that is deterministic. We begin by replacing each letter of $w$ with +the set of states of $A$, $Q$. Each letter $a$ of $w$ defines an injective function on $Q$, and we draw these functions as directed edges between successive copies of $Q$. For example, if -- cgit v1.2.3