From: Mart Lubbers Date: Thu, 30 Oct 2014 12:17:04 +0000 (+0100) Subject: thesis update X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=416de2c3e45fd89a29a903546081840273b636e2;p=bsc-thesis1415.git thesis update --- diff --git a/thesis2/0.1_first_intro_draft.tar b/thesis2/0.1_first_intro_draft.tar deleted file mode 100644 index 518e8fa..0000000 Binary files a/thesis2/0.1_first_intro_draft.tar and /dev/null differ diff --git a/thesis2/2.methods.tex b/thesis2/2.methods.tex index a0afd71..9df1941 100644 --- a/thesis2/2.methods.tex +++ b/thesis2/2.methods.tex @@ -47,6 +47,25 @@ converted to a graph representation. \subsection{Directed acyclic graphs(DAG)} Directed acyclic graphs are a special kind of graph that is used to store big -sets of words and has a linear #TODO, CITE THIS# access times. +sets of words and has a complexity of $\mathcal{O}(L)$, meaning the length of +the word you are searching. Figure~\ref{fig:f21} shows a DAG that accepts the +words \textit{aa} and \textit{ab}. Final states are marked with a double circle +and intermediate states are marked with a single circle. +\begin{figure}[H] + \caption{Sample DAG} + \label{fig:f21} + \centering + \digraph[]{graph2}{ + rankdir=LR; + 1, 2 [shape="circle"]; + 3, 4 [shape="doublecircle"]; + 1 -> 2 [label="a"]; + 2 -> 3 [label="a"]; + 2 -> 4 [label="b"]; + } +\end{figure} +Using the algorithm described by Hopcroft et al\cite{Hopcroft1971} the +nodelists are converted into minimal directed acyclic graphs with a low +complexity($\mathcal{O}(N\log{N})$). diff --git a/thesis2/Makefile b/thesis2/Makefile index 9dfa35d..b01de17 100644 --- a/thesis2/Makefile +++ b/thesis2/Makefile @@ -3,10 +3,12 @@ SHELL:=/bin/bash all: thesis thesis: - pdflatex thesis.tex - pdflatex thesis.tex -# bibtex thesis.aux - pdflatex thesis.tex + latex thesis.tex + bibtex thesis.aux + latex -shell-escape thesis.tex + latex thesis.tex + dvipdfm thesis.dvi clean: - rm -vf *.aux *.bbl *.blg *.dvi *.log *.out *.pdf *.toc + rm -vf *.{aux,bbl,blg,dvi,log,out,pdf,toc,dot,ps} + diff --git a/thesis2/thesis.bib b/thesis2/thesis.bib new file mode 100644 index 0000000..5f1655d --- /dev/null +++ b/thesis2/thesis.bib @@ -0,0 +1,107 @@ +@inproceedings{Aitken2002, +author = {Aitken, James Stuart}, +booktitle = {Proceedings of the 15th Eureopean Conference on Artificial Intelligence}, +file = {:home/mart/articles/2002/Aitken\_Learning Information Extraction Rules An Inductive Logic Programming approach.pdf:pdf}, +title = {{Learning Information Extraction Rules : An Inductive Logic Programming approach}}, +year = {2002} +} +@article{Berry1986, +author = {Berry, Gerard and Sethi, Ravi}, +doi = {10.1016/0304-3975(86)90088-5}, +file = {:home/mart/articles/1986/Berry, Sethi\_From regular expressions to deterministic automata.pdf:pdf}, +issn = {03043975}, +journal = {Theoretical Computer Science}, +month = jan, +pages = {117--126}, +title = {{From regular expressions to deterministic automata}}, +url = {http://linkinghub.elsevier.com/retrieve/pii/0304397586900885}, +volume = {48}, +year = {1986} +} +@article{Berstel2010, +archivePrefix = {arXiv}, +arxivId = {arXiv:1010.5318v3}, +author = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle}, +eprint = {arXiv:1010.5318v3}, +file = {:home/mart/articles/2010/Berstel et al.\_Minimization of automata.pdf:pdf}, +journal = {Mathematics Subject Classification}, +keywords = {finite automata,hopcroft,minimization,s algorithm}, +title = {{Minimization of automata}}, +year = {2010} +} +@article{Bruggemann-klein1993, +author = {Br\"{u}ggemann-klein, Anne}, +file = {:home/mart/articles/1993/Br\"{u}ggemann-klein\_Regular expressions into finite automata.pdf:pdf}, +journal = {Theoretical Computer Science}, +pages = {197--213}, +title = {{Regular expressions into finite automata}}, +volume = {120}, +year = {1993} +} +@article{Daciuk2000, +author = {Daciuk, Jan and Mihov, Stoyan and Watson, Bruce W. and Watson, Richard E.}, +doi = {10.1162/089120100561601}, +file = {:home/mart/articles/2000/Daciuk et al.\_Incremental Construction of Minimal Acyclic Finite-State Automata.pdf:pdf}, +issn = {0891-2017}, +journal = {Computational Linguistics}, +month = mar, +number = {1}, +pages = {3--16}, +title = {{Incremental Construction of Minimal Acyclic Finite-State Automata}}, +url = {http://www.mitpressjournals.org/doi/abs/10.1162/089120100561601}, +volume = {26}, +year = {2000} +} +@techreport{Hopcroft1971, +author = {Hopcroft, John}, +file = {:home/mart/articles/1971/Hopcroft\_An N log N algorithm for minimizing states in a finite automaton.pdf:pdf}, +title = {{An N log N algorithm for minimizing states in a finite automaton}}, +year = {1971} +} +@article{Hromkovic2001, +author = {Hromkovic, Juraj and Seibert, Sebastian and Wilke, Thomas}, +file = {:home/mart/articles/2001/Hromkovic, Seibert, Wilke\_Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata.pdf:pdf}, +journal = {Journal of Computer and System Sciences}, +keywords = {finite automata,regular expressions}, +pages = {565--588}, +title = {{Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata}}, +volume = {62}, +year = {2001} +} +@article{Knuutila2001, +author = {Knuutila, Timo}, +doi = {10.1016/S0304-3975(99)00150-4}, +file = {:home/mart/articles/2001/Knuutila\_Re-describing an algorithm by Hopcroft.pdf:pdf}, +issn = {03043975}, +journal = {Theoretical Computer Science}, +keywords = {algorithms,finite automata,minimization}, +month = jan, +number = {1-2}, +pages = {333--363}, +title = {{Re-describing an algorithm by Hopcroft}}, +url = {http://linkinghub.elsevier.com/retrieve/pii/S0304397599001504}, +volume = {250}, +year = {2001} +} +@inproceedings{Roelofs2009, +author = {Roelofs, Wouter and Paula, Alessandro Tadeo and Grootjen, Franc}, +booktitle = {Proceedings of the Dutch Information Retrieval Conference}, +file = {:home/mart/articles/2009/Roelofs, Paula, Grootjen\_Programming by Clicking.pdf:pdf}, +keywords = {levenshtein matching,subtree matching,web crawler}, +pages = {2--3}, +title = {{Programming by Clicking}}, +year = {2009} +} +@article{Science1985, +author = {Science, Computer}, +file = {:home/mart/articles/1985/Science\_A. e h r e n f e u c h t •.pdf:pdf}, +pages = {31--55}, +title = {{A. e h r e n f e u c h t •}}, +volume = {40}, +year = {1985} +} +@article{Watson, +author = {Watson, Bruce W and Science, Computing and Eindhoven, Technische Universiteit}, +file = {:home/mart/articles/Unknown/Watson, Science, Eindhoven\_Constructing minimal acyclic deterministic finite automata.pdf:pdf}, +title = {{Constructing minimal acyclic deterministic finite automata}} +} diff --git a/thesis2/thesis.tex b/thesis2/thesis.tex index 288f0e5..6f2b15d 100644 --- a/thesis2/thesis.tex +++ b/thesis2/thesis.tex @@ -1,12 +1,15 @@ \documentclass{scrbook} +%\usepackage{bibtex} \usepackage{scrhack} \usepackage{graphicx} % Images \usepackage{float} % Better placement float figures \usepackage{listings} % Source code formatting -\usepackage{hyperref} % Hyperlinks +\usepackage[dvipdfmx,hidelinks]{hyperref} % Hyperlinks \usepackage{tikz} % Sequence diagrams \usepackage{pgf-umlsd} % +\usepackage{graphviz} % For the DAG diagrams +\usepackage{amssymb} \usepgflibrary{arrows} % % Set listings settings @@ -79,4 +82,7 @@ data to structured data} \chapter{Appendices} \input{5.appendices.tex} +\bibliographystyle{plain} +\bibliography{thesis} + \end{document}