diff options
| -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 |