diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-05 21:21:05 -0400 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-08-05 21:21:05 -0400 |
commit | 74019ab472c3abc66b0b2fc1f88c56b315694eb7 (patch) | |
tree | 3b400b43f2ceff1948d3a878052d06f087b1301c | |
parent | d66b548492085b87869048adedb2417ed537daca (diff) |
Create outline with dummy sections
-rw-r--r-- | mgr.tex | 16 |
1 files changed, 15 insertions, 1 deletions
@@ -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} |