updated hws
authorChristian Urban <christian dot urban at kcl dot ac dot uk>
Thu, 08 Oct 2015 14:06:18 +0100
changeset 347 22b5294daa2a
parent 346 a98794b11ac4
child 348 31e89128ccd2
updated hws
hws/hw01.pdf
hws/hw02.pdf
hws/hw02.tex
hws/hw03.pdf
hws/hw03.tex
hws/hw04.pdf
hws/hw04.tex
slides/beamerthemeplaincu.sty
style.sty
Binary file hws/hw01.pdf has changed
Binary file hws/hw02.pdf has changed
--- a/hws/hw02.tex	Mon Oct 05 04:05:20 2015 +0100
+++ b/hws/hw02.tex	Thu Oct 08 14:06:18 2015 +0100
@@ -5,6 +5,8 @@
 
 \section*{Homework 2}
 
+\HEADER
+
 \begin{enumerate}
 \item What is the language recognised by the regular expressions
   $(\varnothing^*)^*$.
Binary file hws/hw03.pdf has changed
--- a/hws/hw03.tex	Mon Oct 05 04:05:20 2015 +0100
+++ b/hws/hw03.tex	Thu Oct 08 14:06:18 2015 +0100
@@ -6,6 +6,8 @@
 
 \section*{Homework 3}
 
+\HEADER
+
 \begin{enumerate}
 \item What is a regular language? Are there alternative ways to define this
   notion? If yes, give an explanation why they define the same notion.
Binary file hws/hw04.pdf has changed
--- a/hws/hw04.tex	Mon Oct 05 04:05:20 2015 +0100
+++ b/hws/hw04.tex	Thu Oct 08 14:06:18 2015 +0100
@@ -6,6 +6,8 @@
 
 \section*{Homework 4}
 
+\HEADER
+
 \begin{enumerate}
 
 \item If a regular expression $r$ does not contain any occurrence of $\varnothing$,  
--- a/slides/beamerthemeplaincu.sty	Mon Oct 05 04:05:20 2015 +0100
+++ b/slides/beamerthemeplaincu.sty	Thu Oct 08 14:06:18 2015 +0100
@@ -60,7 +60,7 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 % Frametitles
 
-\setbeamerfont{frametitle}{size={\LARGE}}
+\setbeamerfont{frametitle}{size=\linespread{0.85}{\LARGE}}
 \setbeamerfont{frametitle}{family={\fontspec{Hoefler Text Black}}}
 %\setbeamerfont{frametitle}{family={\usefont{T1}{ptm}{b}{n}}
 \setbeamercolor{frametitle}{fg=ProcessBlue,bg=white}
--- a/style.sty	Mon Oct 05 04:05:20 2015 +0100
+++ b/style.sty	Thu Oct 08 14:06:18 2015 +0100
@@ -44,4 +44,15 @@
 
 \newcommand{\HEADER}{{\bf Please submit your solutions via email. Please submit 
 only ASCII text or PDFs. Every solution should be preceeded by the corresponding 
-question. Solutions will only be accepted until 30th December!}\bigskip}
+question, like:
+
+\begin{center}
+\begin{tabular}{ll}
+Q$n$: & \ldots a difficult question from me\ldots\\
+A:    & \ldots an answer from you \ldots\\
+Q$n+1$ & \ldots another difficult question\ldots\\
+A:     & \ldots another brilliant answer from you\ldots
+\end{tabular}
+\end{center}
+
+\noindent Solutions will only be accepted until 30th December!}\bigskip}