--- a/hw04.tex	Sat Oct 20 16:44:39 2012 +0100
+++ b/hw04.tex	Wed Oct 24 03:40:33 2012 +0100
@@ -93,15 +93,12 @@
 
 % explain what is a context-free grammar and the language it generates 
 %
-% What does it mean for two regular expressions to be equivalent.
 %
 % Define the language L(M) accepted by a deterministic finite automaton M.
 %
-% Draw a parse tree for....
 %
 % does (a + b)*b+ and (a*b+) + (b*b+) define the same language
-%
-% What does it mean for a grammar to be ambiguous
+
 
 \end{document}