thesis2/thesis.bib

   1 @article{Agnihotri2014,
   2 author = {Agnihotri, Deepak and Verma, Kesari and Tripathi, Priyanka},
   3 doi = {10.1109/CSNT.2014.92},
   4 file = {:home/mart/articles/2014/Agnihotri, Verma, Tripathi\_Pattern and Cluster Mining on Text Data.pdf:pdf},
   5 isbn = {978-1-4799-3070-8},
   6 journal = {2014 Fourth International Conference on Communication Systems and Network Technologies},
   7 keywords = {- text mining,1,2,3,4,5,analytics,and analytical methods,essentially,into data for analysis,language,nlp,processing,stemming,stop words,text mining, stop words, stemming, TF - IDF, Clust,tf,the overarching goal is,to turn text,via application of natural},
   8 month = apr,
   9 pages = {428--432},
  10 publisher = {Ieee},
  11 title = {{Pattern and Cluster Mining on Text Data}},
  12 url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6821432},
  13 year = {2014}
  14 }
  15 @inproceedings{Aitken2002,
  16 author = {Aitken, James Stuart},
  17 booktitle = {Proceedings of the 15th Eureopean Conference on Artificial Intelligence},
  18 file = {:home/mart/articles/2002/Aitken\_Learning Information Extraction Rules An Inductive Logic Programming approach.pdf:pdf},
  19 title = {{Learning Information Extraction Rules : An Inductive Logic Programming approach}},
  20 year = {2002}
  21 }
  22 @article{Berry1986,
  23 author = {Berry, Gerard and Sethi, Ravi},
  24 doi = {10.1016/0304-3975(86)90088-5},
  25 file = {:home/mart/articles/1986/Berry, Sethi\_From regular expressions to deterministic automata.pdf:pdf},
  26 issn = {03043975},
  27 journal = {Theoretical Computer Science},
  28 month = jan,
  29 pages = {117--126},
  30 title = {{From regular expressions to deterministic automata}},
  31 url = {http://linkinghub.elsevier.com/retrieve/pii/0304397586900885},
  32 volume = {48},
  33 year = {1986}
  34 }
  35 @article{Berstel2010,
  36 archivePrefix = {arXiv},
  37 arxivId = {arXiv:1010.5318v3},
  38 author = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle},
  39 eprint = {arXiv:1010.5318v3},
  40 file = {:home/mart/articles/2010/Berstel et al.\_Minimization of automata.pdf:pdf},
  41 journal = {Mathematics Subject Classification},
  42 keywords = {finite automata,hopcroft,minimization,s algorithm},
  43 title = {{Minimization of automata}},
  44 year = {2010}
  45 }
  46 @article{Bruggemann-klein1993,
  47 author = {Br\"{u}ggemann-klein, Anne},
  48 file = {:home/mart/articles/1993/Br\"{u}ggemann-klein\_Regular expressions into finite automata.pdf:pdf},
  49 journal = {Theoretical Computer Science},
  50 pages = {197--213},
  51 title = {{Regular expressions into finite automata}},
  52 volume = {120},
  53 year = {1993}
  54 }
  55 @article{Daciuk2000,
  56 author = {Daciuk, Jan and Mihov, Stoyan and Watson, Bruce W. and Watson, Richard E.},
  57 doi = {10.1162/089120100561601},
  58 file = {:home/mart/articles/2000/Daciuk et al.\_Incremental Construction of Minimal Acyclic Finite-State Automata.pdf:pdf},
  59 issn = {0891-2017},
  60 journal = {Computational Linguistics},
  61 month = mar,
  62 number = {1},
  63 pages = {3--16},
  64 title = {{Incremental Construction of Minimal Acyclic Finite-State Automata}},
  65 url = {http://www.mitpressjournals.org/doi/abs/10.1162/089120100561601},
  66 volume = {26},
  67 year = {2000}
  68 }
  69 @techreport{Hopcroft1971,
  70 author = {Hopcroft, John},
  71 file = {:home/mart/articles/1971/Hopcroft\_An N log N algorithm for minimizing states in a finite automaton.pdf:pdf},
  72 title = {{An N log N algorithm for minimizing states in a finite automaton}},
  73 year = {1971}
  74 }
  75 @article{Hromkovic2001,
  76 author = {Hromkovic, Juraj and Seibert, Sebastian and Wilke, Thomas},
  77 file = {:home/mart/articles/2001/Hromkovic, Seibert, Wilke\_Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata.pdf:pdf},
  78 journal = {Journal of Computer and System Sciences},
  79 keywords = {finite automata,regular expressions},
  80 pages = {565--588},
  81 title = {{Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata}},
  82 volume = {62},
  83 year = {2001}
  84 }
  85 @article{Knuutila2001,
  86 author = {Knuutila, Timo},
  87 doi = {10.1016/S0304-3975(99)00150-4},
  88 file = {:home/mart/articles/2001/Knuutila\_Re-describing an algorithm by Hopcroft.pdf:pdf},
  89 issn = {03043975},
  90 journal = {Theoretical Computer Science},
  91 keywords = {algorithms,finite automata,minimization},
  92 month = jan,
  93 number = {1-2},
  94 pages = {333--363},
  95 title = {{Re-describing an algorithm by Hopcroft}},
  96 url = {http://linkinghub.elsevier.com/retrieve/pii/S0304397599001504},
  97 volume = {250},
  98 year = {2001}
  99 }
 100 @article{Roelofs2008,
 101 author = {Roelofs, Wouter},
 102 file = {:home/mart/articles/2005/Roelofs\_HyperBot Building Web Robots for Non-Programmers.pdf:pdf},
 103 title = {{HyperBot Building Web Robots for Non-Programmers}},
 104 year = {2008}
 105 }
 106 @inproceedings{Roelofs2009,
 107 author = {Roelofs, Wouter and Paula, Alessandro Tadeo and Grootjen, Franc},
 108 booktitle = {Proceedings of the Dutch Information Retrieval Conference},
 109 file = {:home/mart/articles/2009/Roelofs, Paula, Grootjen\_Programming by Clicking.pdf:pdf},
 110 keywords = {levenshtein matching,subtree matching,web crawler},
 111 pages = {2--3},
 112 title = {{Programming by Clicking}},
 113 year = {2009}
 114 }
 115 @article{Science1985,
 116 author = {Science, Computer},
 117 file = {:home/mart/articles/1985/Science\_A. e h r e n f e u c h t •.pdf:pdf},
 118 pages = {31--55},
 119 title = {{A. e h r e n f e u c h t •}},
 120 volume = {40},
 121 year = {1985}
 122 }
 123 @article{Watson,
 124 author = {Watson, Bruce W and Science, Computing and Eindhoven, Technische Universiteit},
 125 file = {:home/mart/articles/Unknown/Watson, Science, Eindhoven\_Constructing minimal acyclic deterministic finite automata.pdf:pdf},
 126 title = {{Constructing minimal acyclic deterministic finite automata}}
 127 }
 128 @book{Python,
 129         author = {Rossem, G. Van and Drake, F.L. Drake (eds)},
 130         title = {Python Reference Manual},
 131         publisher = {PythonLabs, Virginia, USA},
 132         year = {2001},
 133         howpublished = {Available at http://www.python.org}
 134 }
 135 @misc{Modpython,
 136         title={mod python: Apache/Python Integration},
 137         author={Trubetskoy, G}
 138 }
 139 @article{Rss,
 140         title={RSS 2.0 Specification},
 141         author={Board, RSS Advisory},
 142         journal={Web available},
 143         year={2007}
 144 }
 145 @article{Atom,
 146         title={The atom syndication format},
 147         author={Nottingham, Mark and Sayre, Robert},
 148         year={2005}
 149 }
 150 @article{Xml,
 151         title={Extensible markup language (XML)},
 152         author={Bray, Tim and Paoli, Jean and Sperberg-McQueen, C Michael and
 153                 Maler, Eve and Yergeau, Fran{\c{c}}ois},
 154         journal={World Wide Web Consortium Recommendation REC-xml-19980210.
 155                 http://www. w3. org/TR/1998/REC-xml-19980210},
 156         year={1998}
 157 }
 158 @article{Xsd,
 159         title={Extensible Stylesheet Language (XSL)-Version 1.0},
 160         author={Adler, Sharon and Milowski, Alex and Richman, Jeremy and Zilles,
 161                 Steve and others},
 162         year={2001},
 163         publisher={Citeseer}
 164 }
 165 @article{apache,
 166         title={The Apache HTTP server project},
 167         author={Fielding, Roy T and Kaiser, Gail},
 168         journal={Internet Computing, IEEE},
 169         volume={1},
 170         number={4},
 171         pages={88--90},
 172         year={1997},
 173         publisher={IEEE}
 174 }
 175 @article{Science1985,
 176         author = {Blumer, A and Blumer, J and Haussler, D and Ehrenfeucht, A and
 177                 Chen, M.T. and Seiferas, J},
 178         pages = {31--55},
 179         title = {{The smallest automaton recognizing the subwords of a text.}},
 180         volume = {40},
 181         year = {1985}
 182 }