--- a/ChengsongTanPhdThesis/Chapters/Bitcoded1.tex	Fri Dec 30 01:52:32 2022 +0000
+++ b/ChengsongTanPhdThesis/Chapters/Bitcoded1.tex	Fri Dec 30 17:37:51 2022 +0000
@@ -704,6 +704,7 @@
 \end{tabular}    
 \end{center}    
 \noindent
+For $\bder \; c\; a$, we use the infix notation $a\backslash c$ for readability.
 The $\bder$ function tells us how regular expressions can be recursively traversed,
 where the bitcodes are augmented and carried around 
 when a derivative is taken.