diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-14 16:39:30 +0200 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-14 16:39:30 +0200 |
commit | 5de51f2643906035cdcc827a47a18413b97f1c56 (patch) | |
tree | c75ee01cbe70419cdfc72f3515b7ce1673466ffe | |
parent | f8ec20fec33ed4b2a6dcd59b543d11568f316bd7 (diff) |
Reword
-rw-r--r-- | mgr.tex | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -166,10 +166,10 @@ order is in \constantdelaylin, and \textcite{kazana2013} revisit this result, proving it using deterministic factorization forests due to \textcite{colcombet} rather than Bagan's intricate indexing structure. -Colcombet's result could likely be used to solve the problem of branch infix -regular queries, which we introduce as a subproblem of MSO query answering in -Chapter \ref{branchinfix}. However, Colcombet's factorization depends on fairly -deep and complex applications of semigroup theory. We present a much more +Colcombet's factorization could likely be used to solve the problem of branch +infix regular queries, which we introduce as a subproblem of MSO query answering +in Chapter \ref{branchinfix}. However, Colcombet's result depends on fairly deep +and complex applications of semigroup theory. We present a much more straightforward algorithmic approach. \section{Organization} |