--- a/slides/slides02.tex	Thu Oct 05 10:31:05 2023 +0100
+++ b/slides/slides02.tex	Thu Oct 05 14:36:54 2023 +0100
@@ -69,6 +69,12 @@
 \end{frame}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%     
 
+{
+\setbeamercolor{background canvas}{bg=cream}
+\begin{frame}<1-4>[c]
+\end{frame}
+}
+
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}[t]
   \frametitle{
@@ -1145,52 +1151,52 @@
 \end{frame}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  der c (r*) def = (der c r) $\cdot$ (r*)\smallskip\\
-  Why in the example (slide 19) the first step is:
-  der a ((a $\cdot$ b) + b)* = (der a ((a $\cdot$ b) + b)) $\cdot$ r\smallskip\\
-  and not\smallskip\\
-  der a ((a $\cdot$ b) + b) = (der a ((a $\cdot$ b) + b)) · (r*)
-\end{mybox3}
-\end{frame}
+% begin{frame}[c]
+% \begin{mybox3}{}
+%   der c (r*) def = (der c r) $\cdot$ (r*)\smallskip\\
+%   Why in the example (slide 19) the first step is:
+%   der a ((a $\cdot$ b) + b)* = (der a ((a $\cdot$ b) + b)) $\cdot$ r\smallskip\\
+%   and not\smallskip\\
+%   der a ((a $\cdot$ b) + b) = (der a ((a $\cdot$ b) + b)) · (r*)
+% \end{mybox3}
+% \end{frame}
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  Would it be possible to find and go over a few examples from the
-  Brzozowski Algorithm, as it doesn't seem to be as simple as it
-  sounds?
-\end{mybox3}
-\end{frame}
+% \begin{frame}[c]
+% \begin{mybox3}{}
+%   Would it be possible to find and go over a few examples from the
+%   Brzozowski Algorithm, as it doesn't seem to be as simple as it
+%   sounds?
+% \end{mybox3}
+% \end{frame}
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  Is it possible to make a visual example of how using simp() function
-  on a (a*)*.b regular expression reduces its runtime? If not it's
-  fine. I am just very surprised that it is so efficient.
-\end{mybox3}
-\end{frame}
+% \begin{frame}[c]
+% \begin{mybox3}{}
+%   Is it possible to make a visual example of how using simp() function
+%   on a (a*)*.b regular expression reduces its runtime? If not it's
+%   fine. I am just very surprised that it is so efficient.
+% \end{mybox3}
+% \end{frame}
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  Do you think the algorithm can be still improved (made faster)?
-\end{mybox3}
-\end{frame}
+% \begin{frame}[c]
+% \begin{mybox3}{}
+%   Do you think the algorithm can be still improved (made faster)?
+% \end{mybox3}
+% \end{frame}
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  Do the regular expression matchers in Python and Java 8 have more
-  features than the one implemented in this module? Or is there
-  another reason for their inefficiency?
-\end{mybox3}
-\end{frame}
+% \begin{frame}[c]
+% \begin{mybox3}{}
+%   Do the regular expression matchers in Python and Java 8 have more
+%   features than the one implemented in this module? Or is there
+%   another reason for their inefficiency?
+% \end{mybox3}
+% \end{frame}
 
-\begin{frame}[c]
-\begin{mybox3}{}
-  Will we discuss the broader Chomsky hierarchy of languages at some
-  point?
-\end{mybox3}
-\end{frame}
+% \begin{frame}[c]
+% \begin{mybox3}{}
+%   Will we discuss the broader Chomsky hierarchy of languages at some
+%   point?
+% \end{mybox3}
+% \end{frame}
 
 \begin{frame}<1-8>[c]
 \end{frame}