869 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

   870 \begin{frame}[t]

   871 \frametitle{Brzozowski: \boldmath$a^{?\{n\}} \cdot a^{\{n\}}$}

   872 

   873 \begin{center}

   874 \begin{tikzpicture}

   875 \begin{axis}[

   876     xlabel={$n$},

   877     x label style={at={(1.05,0.0)}},     

   878     ylabel={time in secs},

   879     enlargelimits=false,

   880     xtick={0,5000,...,10000},

   881     xmax=11000,

   882     ymax=35,

   883     ytick={0,5,...,30},

   884     scaled ticks=false,

   885     axis lines=left,

   886     width=9cm,

   887     height=7cm,

   888     legend entries={Scala V2,Scala V3,Rust},  

   889     legend pos=north east

   890 ]

   891 \addplot[green,mark=square*,mark options={fill=white}] table {re2.data};

   892 \addplot[black,mark=square*,mark options={fill=white}] table {re3.data};

   893 \addplot[pink,mark=triangle,mark options={fill=pink}] table {re-rust.data};

   894 \end{axis}

   895 \end{tikzpicture}

   896 \end{center}

   897 

   898 \end{frame}

   899 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   

   900 

  1144 

  1145 \begin{frame}[c]

  1146 \begin{mybox3}{}

  1147   der c (r*) def = (der c r) $\cdot$ (r*)\smallskip\\

  1148   Why in the example (slide 19) the first step is:

  1149   der a ((a $\cdot$ b) + b)* = (der a ((a $\cdot$ b) + b)) $\cdot$ r\smallskip\\

  1150   and not\smallskip\\

  1151   der a ((a $\cdot$ b) + b) = (der a ((a $\cdot$ b) + b)) · (r*)

  1152 \end{mybox3}

  1153 \end{frame}

  1154 

  1155 \begin{frame}[c]

  1156 \begin{mybox3}{}

  1157   Would it be possible to find and go over a few examples from the

  1158   Brzozowski Algorithm, as it doesn't seem to be as simple as it

  1159   sounds?

  1160 \end{mybox3}

  1161 \end{frame}

  1162 

  1163 \begin{frame}[c]

  1164 \begin{mybox3}{}

  1165   Is it possible to make a visual example of how using simp() function

  1166   on a (a*)*.b regular expression reduces its runtime? If not it's

  1167   fine. I am just very surprised that it is so efficient.

  1168 \end{mybox3}

  1169 \end{frame}

  1170 

  1171 \begin{frame}[c]

  1172 \begin{mybox3}{}

  1173   Do you think the algorithm can be still improved (made faster)?

  1174 \end{mybox3}

  1175 \end{frame}

  1176 

  1177 \begin{frame}[c]

  1178 \begin{mybox3}{}

  1179   Do the regular expression matchers in Python and Java 8 have more

  1180   features than the one implemented in this module? Or is there

  1181   another reason for their inefficiency?

  1182 \end{mybox3}

  1183 \end{frame}

  1184 

  1185 \begin{frame}[c]

  1186 \begin{mybox3}{}

  1187   Will we discuss the broader Chomsky hierarchy of languages at some

  1188   point?

  1189 \end{mybox3}

  1190 \end{frame}

  1191 

  1192 \begin{frame}<1-8>[c]

  1193 \end{frame}