jan/uni_notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2026-04-08 15:13:13

Browse Source
This commit is contained in:
Jan Meyer
2026-04-08 15:13:13 +02:00
parent 33843cd0e6
commit 518f51dd42
2 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
.obsidian/workspace.json vendored
View File

@@ -27,7 +27,7 @@
"state": { "state": {
"type": "markdown", "type": "markdown",
"state": { "state": {
"file": "00 Inbox/29593975 - Regular Expressions.md", "file": "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md",
"mode": "source", "mode": "source",
"source": false "source": false
}, },
@@ -107,7 +107,7 @@
} }
], ],
"direction": "horizontal", "direction": "horizontal",
"width": 200 "width": 411.50418853759766
}, },
"right": { "right": {
"id": "8a65bc0c1d4d98f2", "id": "8a65bc0c1d4d98f2",
@@ -211,10 +211,10 @@
"darlal-switcher-plus:Open Symbols for the active editor": false "darlal-switcher-plus:Open Symbols for the active editor": false
} }
}, },
"active": "e179fd2c20f4067e", "active": "7a0e7b37bd89861d",
"lastOpenFiles": [ "lastOpenFiles": [
"10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593952 - Regular Languages.md", "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/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/29593852 - Strings.md",
"10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593958 - Kleene star of languages.md", "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593958 - Kleene star of languages.md",

3
00 Inbox/29593975 - Regular Expressions.md → 10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593975 - Regular Expressions.md
View File

@@ -30,4 +30,5 @@ A _regular expression_ $r$ over an alphabet $Sigma$ is defined recursively:
> $r = (a +b)^* a b (a + b)^*$ > $r = (a +b)^* a b (a + b)^*$
## Equivalence of regular expressions ## 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)$). 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)$).