hws/hw06.tex
changeset 577 7a437f1f689d
parent 459 780486571e38
child 595 4bf0096bc06b
--- a/hws/hw06.tex	Fri Oct 12 10:16:54 2018 +0100
+++ b/hws/hw06.tex	Sat Oct 13 13:51:28 2018 +0100
@@ -57,14 +57,18 @@
 and (ii) give a sample string involving all rules given in 1.-4.~that 
 can be parsed by this grammar.
 
-\item Given the regular expression
-
-\[(ab + a)\cdot (\ONE + b)\]
+\item Given the regular expressions
 
-there are two values for how this regular expression can recognise
-the string $ab$. Give both values and indicate which one is the
-POSIX value.
+\begin{center}
+\begin{tabular}{ll}    
+  1) & $(ab + a)\cdot (\ONE + b)$\\
+  2) & $(aa + a)^*$\\
+\end{tabular}
+\end{center}
 
+there are in case two values for how these regular expressions can
+recognise the string (for 1) $ab$ and (for 2) $aaa$. Give in each case
+both values and indicate which one is the POSIX value.
 \item \POSTSCRIPT        
 \end{enumerate}