Binary file handouts/ho01.pdf has changed

Binary file handouts/ho02.pdf has changed

--- a/handouts/ho02.tex	Thu Dec 31 23:40:48 2015 +0000
+++ b/handouts/ho02.tex	Tue Jan 05 01:46:41 2016 +0000
@@ -14,7 +14,7 @@
 than the matchers from regular expression libraries in Ruby
 and Python (the plots on the left). These plots show the
 running time for the evil regular expression
-$a^?^{\{n\}}\cdot a^{\{n\}}$ and strings composed of $n$ \pcode{a}s.
+$a^?{}^{\{n\}}\cdot a^{\{n\}}$ and strings composed of $n$ \pcode{a}s.
 We will use this regular expression and strings as running
 example. To see the substantial differences in the two plots
 below, note the different scales of the $x$-axes. 
@@ -413,7 +413,7 @@
 \end{figure}
 
 For running the algorithm with our favourite example, the evil
-regular expression $a^?^{\{n\}}a^{\{n\}}$, we need to implement
+regular expression $a^?{}^{\{n\}}a^{\{n\}}$, we need to implement
 the optional regular expression and the exactly $n$-times
 regular expression. This can be done with the translations
 

Binary file handouts/ho03.pdf has changed

Binary file handouts/ho04.pdf has changed

--- a/handouts/ho04.tex	Thu Dec 31 23:40:48 2015 +0000
+++ b/handouts/ho04.tex	Tue Jan 05 01:46:41 2016 +0000
@@ -758,7 +758,7 @@
        (p, (LParens + RParens))\;+\\ 
        (b, (Begin + End))\;+ \\
        (w, WhiteSpacess)
-      \end{array}\right)\LARGE^\mbox{\LARGE*}$
+      \end{array}\right)^{\mbox{\LARGE{}*}}$
 \end{center}
 
 \noindent and ask the algorithm by Sulzmann \& Lu to lex, say

Binary file handouts/ho05.pdf has changed

Binary file handouts/ho06.pdf has changed

Binary file handouts/ho07.pdf has changed

--- a/handouts/ho07.tex	Thu Dec 31 23:40:48 2015 +0000
+++ b/handouts/ho07.tex	Tue Jan 05 01:46:41 2016 +0000
@@ -633,7 +633,7 @@
 \lstinputlisting[language=JVMIS]{../progs/test-small.j}
 \caption{Generated code for a test program. This code can be 
 processed by an Java assembler producing a class-file, which
-can be run by the \pcode{java}-program.\label{test}}
+can be run by the {\tt{}java}-program.\label{test}}
 \end{figure}
 
 \end{document}

Binary file handouts/ho08.pdf has changed

Binary file handouts/notation.pdf has changed

Binary file handouts/scala-ho.pdf has changed

Binary file hws/hw01.pdf has changed

--- a/hws/hw01.tex	Thu Dec 31 23:40:48 2015 +0000
+++ b/hws/hw01.tex	Tue Jan 05 01:46:41 2016 +0000
@@ -38,7 +38,8 @@
 \item Assume the concatenation operation of two strings is
       written as $s_1 @ s_2$. Define the operation of
       \emph{concatenating} two sets of strings. This operation
-      is also written as $\_ \,@\, \_$.
+      is also written as $\_ \,@\, \_$. According to 
+      this definition, what is $A \,@\, \{\}$ equal to?
 
 \item Assume a set $A$ contains 4 strings and a set $B$
       contains 7 strings. None of the strings is the empty

Binary file hws/hw02.pdf has changed

Binary file hws/hw03.pdf has changed

Binary file hws/hw04.pdf has changed

Binary file hws/hw05.pdf has changed

Binary file hws/hw06.pdf has changed

Binary file hws/hw07.pdf has changed

Binary file hws/hw08.pdf has changed

Binary file hws/hw09.pdf has changed

Binary file hws/proof.pdf has changed

Binary file slides/slides01.pdf has changed

Binary file slides/slides02.pdf has changed

--- a/style.sty	Thu Dec 31 23:40:48 2015 +0000
+++ b/style.sty	Tue Jan 05 01:46:41 2016 +0000
@@ -55,4 +55,5 @@
 \end{tabular}
 \end{center}
 
-\noindent Solutions will only be accepted until 30th December!}\bigskip}
+\noindent Solutions will only be accepted until 30th December! Please send only
+one homework per email.}\bigskip}