diff options
| -rw-r--r-- | mgr.tex | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -413,8 +413,8 @@ $a : Q \to Q$, and we draw these functions as directed edges between successive copies of $Q$. For example, suppose the $i$th letter of $w$ is $a$. If $A$ in state $q$, reading $a$, would move to state $q'$, then there will be an edge from $(i-1).q$ to $i.q'$. We can think of this construction as first drawing -copies of $Q$ around each letter of $w$, then replacing each letter by the edges -induced by it in $A$'s transition function. +copies of $Q$ around each letter of $w$, then replacing each letter with the +edges induced by $A$'s transition function. Note that by determinism, each vertex has exactly one outgoing edge (except for vertices in the last copy of $Q$ which have no outgoing edges at all). |