ChengsongTanPhdThesis/Chapters/Bitcoded1.tex
changeset 639 80cc6dc4c98b
parent 638 dd9dde2d902b
child 640 bd1354127574
equal deleted inserted replaced
638:dd9dde2d902b 639:80cc6dc4c98b
   702       $_{bs}(\textit{fuse}\, [Z] \; r\,\backslash c)\cdot
   702       $_{bs}(\textit{fuse}\, [Z] \; r\,\backslash c)\cdot
   703        (_{[]}r^*))$
   703        (_{[]}r^*))$
   704 \end{tabular}    
   704 \end{tabular}    
   705 \end{center}    
   705 \end{center}    
   706 \noindent
   706 \noindent
       
   707 For $\bder \; c\; a$, we use the infix notation $a\backslash c$ for readability.
   707 The $\bder$ function tells us how regular expressions can be recursively traversed,
   708 The $\bder$ function tells us how regular expressions can be recursively traversed,
   708 where the bitcodes are augmented and carried around 
   709 where the bitcodes are augmented and carried around 
   709 when a derivative is taken.
   710 when a derivative is taken.
   710 We give the intuition behind some of the more involved cases in 
   711 We give the intuition behind some of the more involved cases in 
   711 $\bder$.
   712 $\bder$.