From b235764fdf024b3de3b8a7a10eca56914da1967b Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Thu, 16 Dec 2021 17:19:59 +0100 Subject: Style --- mgr.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/mgr.tex b/mgr.tex index e8b0717..b675720 100644 --- a/mgr.tex +++ b/mgr.tex @@ -531,7 +531,7 @@ labeled with letter $a$ and let $y$ be its parent (or the new vertex $\mathsf{root}$ when $x$ is the root of $T$). If $A$ in state $q$, reading letter $a$ goes to $q'$, then there will be an edge from $y.q$ to $x.q'$. In the word case we had placed copies of $Q$ around each letter and replaced the -letters with edges implied by $A$'s transition function, here we performed an +letters with edges implied by $A$'s transition function, here we perform an analogous transformation on a tree shaped input. We also color all vertices with colors $1, \ldots, |Q|$ in this graph, -- cgit v1.2.3