handouts/notation.tex
changeset 398 c8ce95067c1a
parent 332 4755ad4b457b
child 404 245d302791c7
--- a/handouts/notation.tex	Mon Feb 22 22:09:31 2016 +0000
+++ b/handouts/notation.tex	Tue Mar 22 17:09:24 2016 +0000
@@ -8,8 +8,8 @@
 
 \section*{A Crash-Course on Notation}
 
-There are innumerable books available about automata and
-formal languages. Unfortunately, they often use their own
+There are innumerable books available about compiler, automata
+and formal languages. Unfortunately, they often use their own
 notational conventions and their own symbols. This handout is
 meant to clarify some of the notation I will use.
 
@@ -190,7 +190,7 @@
 \noindent but using the big union notation is more concise.
 
 An important notion in this module are \defn{languages}, which
-are sets of strings. The main goal for us will be how to
+are sets of strings. One of the main goals for us will be how to
 (formally) specify languages and to find out whether a string
 is in a language or not.\footnote{You might wish to ponder
 whether this is in general a hard or easy problem, where