fix footnote

Author: justinmeiners

01_data_structures.html

@@ -110,9 +110,6 @@ <h2>Reflections on Trusting Trust</h2>
 We should be writing basic code, character by character, identical.
 Imagine how wonderful it would be if you could understand what someone else wrote.</p>
 
-<p>   which can recognize a given regular expression.
-   See <a href="https://swtch.com/~rsc/regexp/regexp1.html">&ldquo;Regular Expression Matching Can Be Simple And Fast&rdquo;</a>.</p>
-
 <a name="Hello-2c--World"></a>
 <h2>Hello, World</h2>
 
@@ -398,7 +395,8 @@ <h2>Code</h2>
 <li id="fn:1">
 From the 1980 Turing award lecture <a href="https://www.cs.fsu.edu/~engelen/courses/COP4610/hoare.pdf">&ldquo;The Emperor&rsquo;s New Clothes&rdquo;</a>.<a href="#fnref:1" rev="footnote">&#8617;</a></li>
 <li id="fn:2">
-Ken&rsquo;s algorithm generates a finite state machine<a href="#fnref:2" rev="footnote">&#8617;</a></li>
+Ken&rsquo;s brilliant algorithm is to generate a finite state machine to recognize a given expression.
+See <a href="https://swtch.com/~rsc/regexp/regexp1.html">&ldquo;Regular Expression Matching Can Be Simple And Fast&rdquo;</a> or Ken&rsquo;s original paper <a href="papers/regular-expressions.pdf">&ldquo;Regular Expression Search Algorithm&rdquo;</a><a href="#fnref:2" rev="footnote">&#8617;</a></li>
 <li id="fn:3">
 Alex recommended to me Marvin Minsky&rsquo;s <a href="https://dl.acm.org/doi/book/10.5555/1095587">&ldquo;Computation: Finite and Infinite Machines&rdquo;</a>
 to learn more about these topics.

01_data_structures.md

@@ -104,9 +104,8 @@ Imagine how wonderful it would be if you could understand what someone else wrot
 
 [^hoare-speech]: From the 1980 Turing award lecture ["The Emperor's New Clothes"][hoare-speech].
 
-[^regex-algorithm]: Ken's algorithm generates a finite state machine 
-   which can recognize a given regular expression.
-   See ["Regular Expression Matching Can Be Simple And Fast"][regex-fast].
+[^regex-algorithm]: Ken's brilliant algorithm is to generate a finite state machine to recognize a given expression.
+    See ["Regular Expression Matching Can Be Simple And Fast"][regex-fast] or Ken's original paper ["Regular Expression Search Algorithm"][regex-paper]
 
 [fortune]: https://en.wikipedia.org/wiki/Fortune_(Unix)
 [dennis]: https://en.wikipedia.org/wiki/Dennis_Ritchie
@@ -126,8 +125,8 @@ Imagine how wonderful it would be if you could understand what someone else wrot
 [hoare]: https://en.wikipedia.org/wiki/Tony_Hoare
 [hoare-speech]: https://www.cs.fsu.edu/~engelen/courses/COP4610/hoare.pdf
 [wirth]: https://en.wikipedia.org/wiki/Niklaus_Wirth
-
 [access-types]: http://goanna.cs.rmit.edu.au/dale/ada/aln/13_access_types.html
+[regex-paper]: papers/regular-expressions.pdf
 
 ## Hello, World