diff options
| author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-06 14:28:54 -0400 |
|---|---|---|
| committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-06 14:28:54 -0400 |
| commit | 112232de666efd87c5e7dbf05efa277564cea204 (patch) | |
| tree | ec069225ac0bb527ca0c9b9a33ebf3723da6ec6e | |
| parent | c06424befd41a214720f2b746e83445e93bf917e (diff) | |
Stylistic change
| -rw-r--r-- | mgr.tex | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -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 |