hws/hw03.tex
changeset 146 9da175d5eb63
parent 132 04264d0c43bb
child 258 1e4da6d2490c
--- a/hws/hw03.tex	Wed Oct 16 02:07:02 2013 +0100
+++ b/hws/hw03.tex	Mon Oct 21 15:02:54 2013 +0100
@@ -12,7 +12,7 @@
 \item What is a regular language?
 
 \item Assume you have an alphabet consisting of the letters $a$, $b$ and $c$ only.
-(a) Find a regular expression that recognises the two strings $ab$ and $ac$. (b)
+(1) Find a regular expression that recognises the two strings $ab$ and $ac$. (2)
 Find a regular expression that matches all strings \emph{except} these two strings.
 Note, you can only use regular expressions of the form 
 \begin{center}