Mercurial > 13ss.theoinf

changeset 49:72ac27051d7e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
fix some more errors; reorganize complete notes
author Markus Kaiser <markus.kaiser@in.tum.de>
date Thu, 11 Jul 2013 23:38:43 +0200
parents 903e6a8959d7
children 25651c6dba7c
files notes/tex/automatons.tex notes/tex/complete_notes.tex notes/tex/computation.tex notes/tex/grammars.tex notes/tex/ue07_notes.tex
diffstat 5 files changed, 12 insertions(+), 18 deletions(-) [+]
line wrap: on
line diff
--- a/notes/tex/automatons.tex	Thu Jul 11 23:14:17 2013 +0200
+++ b/notes/tex/automatons.tex	Thu Jul 11 23:38:43 2013 +0200
@@ -219,7 +219,7 @@
 \end{frame}
 }
 
-\defineUnit{rezuenfabeispiel}{%
+\defineUnit{rezuenfazwei}{%
 \begin{frame}
     \frametitle{RE $\rightarrow$ $\epsilon$-NFA}
     \setbeamercovered{dynamic}
--- a/notes/tex/complete_notes.tex	Thu Jul 11 23:14:17 2013 +0200
+++ b/notes/tex/complete_notes.tex	Thu Jul 11 23:38:43 2013 +0200
@@ -16,7 +16,6 @@
 \showUnit{dfa}
 \showUnit{nfa}
 \showUnit{enfa}
-\showUnit{automatenkonversionen}
 \showUnit{name}
 
 % ue02
@@ -33,12 +32,12 @@
 \showUnit{nfazure}
 \showUnit{rpl}
 \showUnit{rplanwenden}
-\showUnit{regulaeresprachen}
 
 % ue04
 \showUnit{aequivalentezustaende}
 \showUnit{unterscheidbarezustande}
 \showUnit{quotientenautomat}
+\showUnit{regulaeresprachen}
 
 % ue05
 \showUnit{grammatik}
@@ -58,30 +57,25 @@
 \showUnit{pda}
 \showUnit{pdaakzeptanz}
 \showUnit{pdabeispiel}
+\showUnit{kontextfreiesprachen}
 
 % ue08
 \showUnit{tmdefinition}
 \showUnit{tmvisualisierung}
 \showUnit{ndtm}
 
-% ue09
+% ue09, ue10
 \showUnit{chomsky}
-\showUnit{berechenbarkeit}
-\showUnit{berechenbarkeitbeispiel}
 \showUnit{loop}
 \showUnit{pr}
 \showUnit{prrekursion}
 \showUnit{prprogramme}
 \showUnit{prerweitert}
+\showUnit{prmax}
+\showUnit{murekursion}
 \showUnit{tmif}
 \showUnit{while}
 \showUnit{goto}
-
-% ue10
-\showUnit{loop}
-\showUnit{prerweitert}
-\showUnit{prmax}
-\showUnit{murekursion}
 \showUnit{berechenbarkeit}
 \showUnit{entscheidbarkeit}
 \showUnit{breduktion}
--- a/notes/tex/computation.tex	Thu Jul 11 23:14:17 2013 +0200
+++ b/notes/tex/computation.tex	Thu Jul 11 23:38:43 2013 +0200
@@ -254,16 +254,16 @@
 
     U.a. diese Programme sind laut Vorlesung oder Übung PR:
     \begin{itemize}
+        \item $pred(x) = \max \left\{ 0, x - 1 \right\}$
         \item \alert{$add(x, y) = x + y$}
+        \item \alert{$x \dot{-} y = \max \left\{ 0, x - y \right\}$}
         \item \alert{$mult(x, y) = x \cdot y$}
-        \item $pred(x) = \max \left\{ 0, x - 1 \right\}$
-        \item \alert{$x \dot{-} y = \max \left\{ 0, x - y \right\}$}
         \item $div(x, y) = x \div y$ (Ganzzahldivision)
-        \item $mod(x, y) = x \mod y$
+        \item Die restliche einfache Arithmetik\ldots
             \vspace{1.5em}
         \item $tower(n) = 2^{2^{2^{\iddots}}}$ mit $tower(4) = 2^{16}$
-        \item $sqr(x) = x^2$
-        \item $twopow(n) = 2^n$
+        \item $sqr(x) = x^2$, $sqrt(x) = \sqrt{x}$
+        \item $c(x), p_1(x), p_2(x)$ (Cantorsche Paarungsfunktion)
         \item $ifthen(n, a, b) = \begin{cases} a & n \neq 0 \\ b & n = 0 \end{cases}$
     \end{itemize}
 \end{frame}
--- a/notes/tex/grammars.tex	Thu Jul 11 23:14:17 2013 +0200
+++ b/notes/tex/grammars.tex	Thu Jul 11 23:38:43 2013 +0200
@@ -424,7 +424,6 @@
         \end{tikzpicture}
     \end{center}
 
-    \pause
     \vfill
 
     \begin{itemize}
--- a/notes/tex/ue07_notes.tex	Thu Jul 11 23:14:17 2013 +0200
+++ b/notes/tex/ue07_notes.tex	Thu Jul 11 23:38:43 2013 +0200
@@ -12,4 +12,5 @@
 \showUnit{pda}
 \showUnit{pdaakzeptanz}
 \showUnit{pdabeispiel}
+\showUnit{kontextfreiesprachen}
 \end{document}