Update 2024-07-10-automata.md

Author: eliotwrobson

_posts/2024-07-10-automata.md

@@ -74,8 +74,6 @@ To the authors' knowledge, this is the only Python package implementing all of t
 
 ![A visualization of `target_words_dfa`. Transitions on characters leading to immediate rejections are omitted.]({{ site.url }}/images/automata/finite_language_dfa.png)
 
-![\label{fig:target_words_dfa}](finite_language_dfa.png){ width=100% }
-
 The following example is inspired by the use case described in [this blog post](http://blog.notdot.net/2010/07/Damn-Cool-Algorithms-Levenshtein-Automata).
 We wish to determine which strings in a given set are within the target edit distance
 to a reference string. We will first initialize a DFA corresponding to a fixed set of target words