thesis2/thesis.bib

   1 @inproceedings{Aitken2002,
   2 author = {Aitken, James Stuart},
   3 booktitle = {Proceedings of the 15th Eureopean Conference on Artificial Intelligence},
   4 file = {:home/mart/articles/2002/2002\_Aitken\_Learning Information Extraction Rules An Inductive Logic Programming approach.pdf:pdf},
   5 title = {{Learning Information Extraction Rules : An Inductive Logic Programming approach}},
   6 year = {2002}
   7 }
   8 @article{Berry1986,
   9 author = {Berry, Gerard and Sethi, Ravi},
  10 doi = {10.1016/0304-3975(86)90088-5},
  11 file = {:home/mart/articles/1986/1986\_Berry, Sethi\_From regular expressions to deterministic automata.pdf:pdf},
  12 issn = {03043975},
  13 journal = {Theoretical Computer Science},
  14 month = jan,
  15 pages = {117--126},
  16 title = {{From regular expressions to deterministic automata}},
  17 url = {http://linkinghub.elsevier.com/retrieve/pii/0304397586900885},
  18 volume = {48},
  19 year = {1986}
  20 }
  21 @article{Berstel2010,
  22 archivePrefix = {arXiv},
  23 arxivId = {arXiv:1010.5318v3},
  24 author = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle},
  25 eprint = {arXiv:1010.5318v3},
  26 file = {:home/mart/articles/2010/2010\_Berstel et al.\_Minimization of automata.pdf:pdf},
  27 journal = {Mathematics Subject Classification},
  28 keywords = {finite automata,hopcroft,minimization,s algorithm},
  29 title = {{Minimization of automata}},
  30 year = {2010}
  31 }
  32 @article{Bruggemann-klein1993,
  33 author = {Br\"{u}ggemann-klein, Anne},
  34 file = {:home/mart/articles/1993/1993\_Br\"{u}ggemann-klein\_Regular expressions into finite automata.pdf:pdf},
  35 journal = {Theoretical Computer Science},
  36 pages = {197--213},
  37 title = {{Regular expressions into finite automata}},
  38 volume = {120},
  39 year = {1993}
  40 }
  41 @article{Daciuk2000,
  42 author = {Daciuk, Jan and Mihov, Stoyan and Watson, Bruce W. and Watson, Richard E.},
  43 doi = {10.1162/089120100561601},
  44 file = {:home/mart/articles/2000/2000\_Daciuk et al.\_Incremental Construction of Minimal Acyclic Finite-State Automata.pdf:pdf},
  45 issn = {0891-2017},
  46 journal = {Computational Linguistics},
  47 month = mar,
  48 number = {1},
  49 pages = {3--16},
  50 title = {{Incremental Construction of Minimal Acyclic Finite-State Automata}},
  51 url = {http://www.mitpressjournals.org/doi/abs/10.1162/089120100561601},
  52 volume = {26},
  53 year = {2000}
  54 }
  55 @article{Grootjen2014,
  56 author = {Grootjen, Franc and Otworowska, Maria},
  57 file = {:home/mart/articles/2014/2014\_Grootjen, Otworowska\_Proceedings of the 26th Benelux Conference on Artificial Intelligence.pdf:pdf},
  58 title = {{Proceedings of the 26th Benelux Conference on Artificial Intelligence}},
  59 year = {2014}
  60 }
  61 @techreport{Hopcroft1971,
  62 author = {Hopcroft, John},
  63 file = {:home/mart/articles/1971/1971\_Hopcroft\_An N log N algorithm for minimizing states in a finite automaton.pdf:pdf},
  64 title = {{An N log N algorithm for minimizing states in a finite automaton}},
  65 year = {1971}
  66 }
  67 @article{Hromkovic2001,
  68 author = {Hromkovic, Juraj and Seibert, Sebastian and Wilke, Thomas},
  69 file = {:home/mart/articles/2001/2001\_Hromkovic, Seibert, Wilke\_Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata.pdf:pdf},
  70 journal = {Journal of Computer and System Sciences},
  71 keywords = {finite automata,regular expressions},
  72 pages = {565--588},
  73 title = {{Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata}},
  74 volume = {62},
  75 year = {2001}
  76 }
  77 @article{Knuutila2001,
  78 author = {Knuutila, Timo},
  79 doi = {10.1016/S0304-3975(99)00150-4},
  80 file = {:home/mart/articles/2001/2001\_Knuutila\_Re-describing an algorithm by Hopcroft.pdf:pdf},
  81 issn = {03043975},
  82 journal = {Theoretical Computer Science},
  83 keywords = {algorithms,finite automata,minimization},
  84 month = jan,
  85 number = {1-2},
  86 pages = {333--363},
  87 title = {{Re-describing an algorithm by Hopcroft}},
  88 url = {http://linkinghub.elsevier.com/retrieve/pii/S0304397599001504},
  89 volume = {250},
  90 year = {2001}
  91 }
  92 @article{Roelofs2008,
  93 author = {Roelofs, Wouter},
  94 file = {:home/mart/articles/2008/2008\_Roelofs\_HyperBot Building Web Robots for Non-Programmers.pdf:pdf},
  95 title = {{HyperBot Building Web Robots for Non-Programmers}},
  96 year = {2008}
  97 }
  98 @inproceedings{Roelofs2009,
  99 author = {Roelofs, Wouter and Paula, Alessandro Tadeo and Grootjen, Franc},
 100 booktitle = {Proceedings of the Dutch Information Retrieval Conference},
 101 file = {:home/mart/articles/2009/2009\_Roelofs, Paula, Grootjen\_Programming by Clicking.pdf:pdf},
 102 keywords = {levenshtein matching,subtree matching,web crawler},
 103 pages = {2--3},
 104 title = {{Programming by Clicking}},
 105 year = {2009}
 106 }
 107 @article{Science1985,
 108 author = {Science, Computer},
 109 file = {:home/mart/articles/1985/1985\_Science\_A. e h r e n f e u c h t •.pdf:pdf},
 110 pages = {31--55},
 111 title = {{A. e h r e n f e u c h t •}},
 112 volume = {40},
 113 year = {1985}
 114 }
 115 @article{Watson,
 116 author = {Watson, Bruce W and Science, Computing and Eindhoven, Technische Universiteit},
 117 file = {:home/mart/articles/Unknown/Unknown\_Watson, Science, Eindhoven\_Constructing minimal acyclic deterministic finite automata.pdf:pdf},
 118 title = {{Constructing minimal acyclic deterministic finite automata}}
 119 }