m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-08-05 21:21:05 -0400
committerMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-08-05 21:21:05 -0400
commit74019ab472c3abc66b0b2fc1f88c56b315694eb7 (patch)
tree3b400b43f2ceff1948d3a878052d06f087b1301c
parentd66b548492085b87869048adedb2417ed537daca (diff)
Create outline with dummy sections
-rw-r--r--mgr.tex16
1 files changed, 15 insertions, 1 deletions
diff --git a/mgr.tex b/mgr.tex
index 37bc034..b042360 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -68,6 +68,19 @@
% \end{quote}
\section{Definitions}
+\subsection{Monadic Second Order Logic}
+a
+\subsection{Trees}
+b
+\subsection{Tree automata}
+c
+\subsection{Query answering problems}
+d
+\section{Known algorithms we will use}
+\subsection{Least Common Ancestor}
+e
+\subsection{Range Minimum Query}
+f
\chapter{Branch Infix Regular Queries}\label{r:branchinfix}
@@ -185,7 +198,8 @@ Now when given a query $x$, $y$, we:
answer to our query.
\end{enumerate}
-\section{Generalizing words to trees}
+\chapter{$k$-relabel Queries on Trees}
+h
\chapter{Conclusions}