updated
authorChristian Urban <christian.urban@kcl.ac.uk>
Sat, 03 Oct 2020 15:21:06 +0100
changeset 770 c563cf946497
parent 769 f9686b22db7e
child 771 3a12e096f9a0
updated
hws/hw02.pdf
hws/hw02.tex
hws/hw03.pdf
hws/hw03.tex
slides/slides02.pdf
slides/slides02.tex
Binary file hws/hw02.pdf has changed
--- a/hws/hw02.tex	Sat Oct 03 00:51:47 2020 +0100
+++ b/hws/hw02.tex	Sat Oct 03 15:21:06 2020 +0100
@@ -48,15 +48,7 @@
       Compute what the derivative of $r$ is with respect to
       $a$, $b$ and $c$. Is $r$ nullable?
 
-\item Prove that for all regular expressions $r$ we have
-      
-\begin{center} 
-  $\textit{nullable}(r) \quad \text{if and only if} 
-  \quad [] \in L(r)$ 
-\end{center}
-
-      Write down clearly in each case what you need to prove
-      and what are the assumptions. 
+\item (Moved to HW3)
   
 \item Define what is meant by the derivative of a regular
       expressions with respect to a character. (Hint: The
Binary file hws/hw03.pdf has changed
--- a/hws/hw03.tex	Sat Oct 03 00:51:47 2020 +0100
+++ b/hws/hw03.tex	Sat Oct 03 15:21:06 2020 +0100
@@ -173,10 +173,21 @@
   has the unique solution $q = s \cdot r^*$.)
 
 \item If a non-deterministic finite automaton (NFA) has
-$n$ states. How many states does a deterministic 
-automaton (DFA) that can recognise the same language
-as the NFA maximal need?
+  $n$ states. How many states does a deterministic 
+  automaton (DFA) that can recognise the same language
+  as the NFA maximal need?
 
+\item Prove that for all regular expressions $r$ we have
+      
+\begin{center} 
+  $\textit{nullable}(r) \quad \text{if and only if} 
+  \quad [] \in L(r)$ 
+\end{center}
+
+      Write down clearly in each case what you need to prove
+      and what are the assumptions. 
+
+  
 \item \POSTSCRIPT  
 \end{enumerate}
 
Binary file slides/slides02.pdf has changed
--- a/slides/slides02.tex	Sat Oct 03 00:51:47 2020 +0100
+++ b/slides/slides02.tex	Sat Oct 03 15:21:06 2020 +0100
@@ -1012,22 +1012,7 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   
 
 
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\begin{frame}[c]
-\frametitle{Coursework 1}
-
-%%\underline{Strand 1:}
-
-\begin{itemize}
-\item Submission on Friday 16 October @ 18:00\medskip
-\item source code needs to be submitted as well\medskip
-\item you can re-use my Scala code from KEATS \\
-  and use any programming language you like\medskip
-\item \small https://nms.kcl.ac.uk/christian.urban/ProgInScala2ed.pdf\normalsize
-\end{itemize}  
-
-\end{frame}
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   
+  
   
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@@ -1198,6 +1183,23 @@
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}[c]
+\frametitle{Coursework 1}
+
+%%\underline{Strand 1:}
+
+\begin{itemize}
+\item Submission on Friday 16 October @ 18:00\medskip
+\item source code needs to be submitted as well\medskip
+\item you can re-use my Scala code from KEATS \\
+  and use any programming language you like\medskip
+\item \small https://nms.kcl.ac.uk/christian.urban/ProgInScala2ed.pdf\normalsize
+\end{itemize}  
+
+\end{frame}
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\begin{frame}[c]
 \frametitle{Epilogue}
 
 \footnotesize