From 518f51dd42f3f65327b80f732f02346c13a6a4ce Mon Sep 17 00:00:00 2001
From: Jan Meyer <git@lolmerkat.cc>
Date: Wed, 8 Apr 2026 15:13:13 +0200
Subject: [PATCH] vault backup: 2026-04-08 15:13:13

---
 .obsidian/workspace.json                                  | 8 ++++----
 .../29593975 - Regular Expressions.md                     | 3 ++-
 2 files changed, 6 insertions(+), 5 deletions(-)
 rename {00 Inbox => 10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen}/29593975 - Regular Expressions.md (86%)

diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index 3002a9d..3a2e601 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -27,7 +27,7 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "00 Inbox/29593975 - Regular Expressions.md",
+                "file": "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md",
                 "mode": "source",
                 "source": false
               },
@@ -107,7 +107,7 @@
       }
     ],
     "direction": "horizontal",
-    "width": 200
+    "width": 411.50418853759766
   },
   "right": {
     "id": "8a65bc0c1d4d98f2",
@@ -211,10 +211,10 @@
       "darlal-switcher-plus:Open Symbols for the active editor": false
     }
   },
-  "active": "e179fd2c20f4067e",
+  "active": "7a0e7b37bd89861d",
   "lastOpenFiles": [
     "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593952 - Regular Languages.md",
-    "00 Inbox/29593975 - Regular Expressions.md",
+    "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md",
     "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593940 - Formal Languages.md",
     "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593852 - Strings.md",
     "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593958 - Kleene star of languages.md",
diff --git a/00 Inbox/29593975 - Regular Expressions.md b/10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md
similarity index 86%
rename from 00 Inbox/29593975 - Regular Expressions.md
rename to 10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md
index b405d3c..82d6259 100644
--- a/00 Inbox/29593975 - Regular Expressions.md	
+++ b/10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md	
@@ -30,4 +30,5 @@ A _regular expression_ $r$ over an alphabet $Sigma$ is defined recursively:
 > $r = (a +b)^* a b (a + b)^*$
 
 ## Equivalence of regular expressions
-Two regular expressiosn $r$ and $s$ are _equivalent_ ($r eq.triple s$ or $r hat(eq) s$) if thy generate the same language ($L(r) eq L(s)$).
\ No newline at end of file
+Two regular expressions $r$ and $s$ are _equivalent_ ($r eq.triple s$ or $r hat(eq) s$) if they generate the same language ($L(r) eq L(s)$).
+