vault backup: 2026-08-04 13:28:26

vault backup: 2026-08-04 13:12:55
vault backup: 2026-08-04 13:00:19
2026-08-04 13:28:26 +02:00 · 2026-08-04 13:12:55 +02:00 · 2026-08-04 13:00:19 +02:00
24 changed files with 10871 additions and 2 deletions
--- a/2026/Automatentheorie
+++ b/2026/Automatentheorie
@@ -23,7 +23,7 @@ A word (or _string_) is a finite sequence $w = a_1 a_2 ... a_n$ if characters fr
 > We will use small letters to describe strings that are part of a language.

 > [!EXAMPLE]
-> $"aa", "ab", "bba"$ and $"baab"$ are strings over $Sigma = {a, b}.
+> $"aa", "ab", "bba"$ and $"baab"$ are strings over $Sigma = {a, b}$.

 #### Length of a string
 The _length_ $abs(x)$ of a string $x = a_1 ... a_n$ is its number $abs(x) = n$ of characters.
--- a/2026/Automatentheorie
+++ b/2026/Automatentheorie
--- a/atfl-st2026-l12-pumping-lemma-cfl.pdf
+++ b/atfl-st2026-l12-pumping-lemma-cfl.pdf
--- a/Library/atfl-st2026-l01-formal-languages-full.pdf
+++ b/Library/atfl-st2026-l01-formal-languages-full.pdf
--- a/Library/atfl-st2026-l02-finite-representation-of-languages-full.pdf
+++ b/Library/atfl-st2026-l02-finite-representation-of-languages-full.pdf
--- a/Library/atfl-st2026-l03-grammars.pdf
+++ b/Library/atfl-st2026-l03-grammars.pdf
--- a/Library/atfl-st2026-l04-chomsky-hierarchy.pdf
+++ b/Library/atfl-st2026-l04-chomsky-hierarchy.pdf
--- a/Library/atfl-st2026-l05-regular-languages-and-finite-automata-full.pdf
+++ b/Library/atfl-st2026-l05-regular-languages-and-finite-automata-full.pdf
--- a/Library/atfl-st2026-l06-non-deterministic-finite-automata-full.pdf
+++ b/Library/atfl-st2026-l06-non-deterministic-finite-automata-full.pdf
--- a/Library/atfl-st2026-l07-epsilon-automata-full.pdf
+++ b/Library/atfl-st2026-l07-epsilon-automata-full.pdf
--- a/Library/atfl-st2026-l08-pumping-lemma-full.pdf
+++ b/Library/atfl-st2026-l08-pumping-lemma-full.pdf
--- a/Library/atfl-st2026-l09-context-free-languages-full.pdf
+++ b/Library/atfl-st2026-l09-context-free-languages-full.pdf
--- a/Library/atfl-st2026-l10-cfl-closure-properties.pdf
+++ b/Library/atfl-st2026-l10-cfl-closure-properties.pdf
--- a/Library/atfl-st2026-l11-cyk-algorithm.pdf
+++ b/Library/atfl-st2026-l11-cyk-algorithm.pdf
--- a/Library/atfl-st2026-l13-pushdown-automaton.pdf
+++ b/Library/atfl-st2026-l13-pushdown-automaton.pdf
--- a/Library/atfl-st2026-l14-deterministic-pda.pdf
+++ b/Library/atfl-st2026-l14-deterministic-pda.pdf
--- a/Library/atfl-st2026-l15-parsing.pdf
+++ b/Library/atfl-st2026-l15-parsing.pdf
--- a/Library/atfl-st2026-l16-turing-machines.pdf
+++ b/Library/atfl-st2026-l16-turing-machines.pdf
--- a/Library/atfl-st2026-l17-multi-tape-turing-machines.pdf
+++ b/Library/atfl-st2026-l17-multi-tape-turing-machines.pdf
--- a/Library/atfl-st2026-l18-halting-problem.pdf
+++ b/Library/atfl-st2026-l18-halting-problem.pdf
--- a/Library/atfl-st2026-l19-busy-beaver.pdf
+++ b/Library/atfl-st2026-l19-busy-beaver.pdf
--- a/Library/atfl-st2026-l20-myhill-nerode-theorem.pdf
+++ b/Library/atfl-st2026-l20-myhill-nerode-theorem.pdf
--- a/Library/atfl-st2026-l21-program-verification.pdf
+++ b/Library/atfl-st2026-l21-program-verification.pdf
--- a/Extras/OOP/die_einen_da
+++ b/Extras/OOP/die_einen_da
Author	SHA1	Message	Date
Jan Meyer	16e1078562	vault backup: 2026-08-04 13:28:26	2026-08-04 13:28:26 +02:00
Jan Meyer	4cb2c7897e	vault backup: 2026-08-04 13:12:55	2026-08-04 13:12:55 +02:00
Jan Meyer	a4a23f2ed3	vault backup: 2026-08-04 13:00:19	2026-08-04 13:00:19 +02:00