--- a/ChengsongTanPhdThesis/Chapters/Inj.tex	Sat Jul 08 22:18:22 2023 +0100
+++ b/ChengsongTanPhdThesis/Chapters/Inj.tex	Sun Jul 09 00:29:02 2023 +0100
@@ -499,7 +499,8 @@
 	amounts of memory: $.^*a.^{\{n\}}bc$ matching
 	strings of the form $aaa\ldots aaaabc$.
 	When traversing in a breadth-first manner,
-all states from 0 till $n+1$ will become active.}
+all states from 0 till $n+1$ will become active.}\label{fig:inj}
+
 \end{figure}
 %Languages like $\mathit{Go}$ and $\mathit{Rust}$ use this
 %type of $\mathit{NFA}$ simulation and guarantees a linear runtime