diff options
| -rw-r--r-- | mgr.tex | 12 |
1 files changed, 7 insertions, 5 deletions
@@ -180,11 +180,13 @@ free variables are all first-order is in \constantdelaylin, and factorization forests due to \textcite{colcombet} rather than Bagan's intricate indexing structure. -Colcombet's factorization could likely be used to solve the problem of branch -infix regular questions, which we introduce as a subproblem of MSO query -answering in Chapter \ref{branchinfix}. However, Colcombet's result depends on -applications of semigroup theory. We present a much more straightforward -algorithmic approach. +Most closely related, \textcite{kazanaphd} showed that MSO query answering on +structures of bounded treewidth is \constantdelaylin in his PhD thesis, however +this result was limited to MSO queries with only first-order variables. This +work generalizes to also allowing set variables in the query, and uses a +different approach. Here again Kazana relied on Colcombet's factorization, an +application of semigroup theory. Our appraoch is more algorithmic and +straigforward. \section{Organization} |