# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1381134654 -3600
# Node ID 5c4998375c46b0d373f7864cc0c682acf68b455e
# Parent  722d88a38b04a6320d9c15a3b3c913edf9fcfc91
added

diff -r 722d88a38b04 -r 5c4998375c46 coursework/cw01.pdf
Binary file coursework/cw01.pdf has changed
diff -r 722d88a38b04 -r 5c4998375c46 coursework/cw01.tex
--- a/coursework/cw01.tex	Mon Oct 07 09:24:22 2013 +0100
+++ b/coursework/cw01.tex	Mon Oct 07 09:30:54 2013 +0100
@@ -13,7 +13,8 @@
 a regular expression matcher and submit a document containing the answers for the questions 
 below. You can do the implementation in any programming language you like, but you need 
 to submit the source code with which you answered the questions. However, the coursework 
-will \emph{only} be judged according to the answers. \bigskip
+will \emph{only} be judged according to the answers. You can submit your answers
+in a txt-file.\bigskip
 
 \noindent
 The task is to implement a regular expression matcher based on derivatives. The implementation 
@@ -60,7 +61,7 @@
 \]
 
 \noindent 
-Be careful that your implementations for $nullable$ and $der$ satisfies for every $r$ the following two
+Be careful that your implementation of $nullable$ and $der$ satisfies for every $r$ the following two
 properties:
 
 \begin{itemize}
@@ -84,7 +85,7 @@
 \noindent
 and calculate the derivative according to your email address. When calculating
 the derivative, simplify all regular expressions as much as possible, but at least apply the following 
-six rules:
+six simplification rules:
 
 \begin{center}
 \begin{tabular}{l@{\hspace{2mm}}c@{\hspace{2mm}}l}
@@ -98,7 +99,7 @@
 \end{center}
 
 \noindent
-Write down your simplified derivative.
+Write down your simplified derivative in the ``mathematicical'' notation using parentheses where necessary.
 
 \subsection*{Question 3 (marked with 1\%)}
 
@@ -116,7 +117,10 @@
 
 Let $r_1$ be the regular expression $a\cdot a\cdot a$ and $r_2$ be $(a^{\{19,19\}}) \cdot (a^?)$.
 Decide whether the following three strings consisting of $a$s only can be matched by $(r_1^+)^+$. 
-Similarly test them with $(r_2^+)^+$. Again answer in all six cases with yes or no. Be careful when 
+Similarly test them with $(r_2^+)^+$. Again answer in all six cases with yes or no. \medskip
+
+\noindent
+These are strings entirely made up of $a$s. Be careful when 
 copy-and-pasting the strings so as to not forgetting any $a$ and to not introducing any
 other character.