From 21762da12c107569905a9e3e4051fe0033833d61 Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Thu, 16 Dec 2021 17:36:00 +0100 Subject: Fix typo --- mgr.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/mgr.tex b/mgr.tex index 15fe64b..90fe948 100644 --- a/mgr.tex +++ b/mgr.tex @@ -788,7 +788,7 @@ interpreted as a bit vector signifying which unary relations $U_X$ a vertex is assigned to. By combining the above reductions, we can solve MSO query answering on trees by -solving the relabel regular qustions problem on trees. Indeed, fix a formula +solving the relabel regular qeustions problem on trees. Indeed, fix a formula $\varphi(\vec{X})$ and take a tree $T$. Derive automaton $A$ and tree $T'$ as above. Label each vertex of $T'$ with $0\ldots0$ (signifying that none of its vertices have yet been assigned to any of the variables in $\vec{X}$). -- cgit v1.2.3