diff options
| -rw-r--r-- | mgr.bib | 11 | ||||
| -rw-r--r-- | mgr.tex | 3 |
2 files changed, 13 insertions, 1 deletions
@@ -110,6 +110,17 @@ author = {Mikołaj Bojańczyk}, title = {Factorization Forests} } +@misc{bojanczyktoolbox, + url = {https://www.mimuw.edu.pl/~bojan/papers/toolbox-reduced-feb6.pdf}, + year = 2018, + % month = {dec}, + % publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})}, + % volume = {17}, + % number = {6}, + pages = {65--70}, + author = {Mikołaj Bojańczyk}, + title = {An Automata Toolbox} +} @inproceedings{amarilli2019, doi = {10.1145/3294052.3319702}, url = {https://doi.org/10.1145%2F3294052.3319702}, @@ -304,7 +304,8 @@ We make use of a fundamental theorem tying MSO logic on trees and tree automata: We note that the converse of this theorem is also true (i.e. that for every tree automaton, there is a corresponding MSO formula), however we will use only the -MSO to automata direction in this work. +MSO to automata direction in this work. See for example Bojańczyk's text +\cite{bojanczyktoolbox} for a proof of both directions. \section{Query answering problems}\label{query-answering-problems} |