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

vault backup: 2026-04-08 15:10:32

Browse Source
This commit is contained in:
Jan Meyer
2026-04-08 15:10:32 +02:00
parent 8bcf049ced
commit 33843cd0e6
3 changed files with 25 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
.obsidian/workspace.json vendored
View File

@@ -34,6 +34,20 @@
"icon": "lucide-file",
"title": "29593975 - Regular Expressions"
}
},
{
"id": "1e58a188bb5d367b",
"type": "leaf",
"state": {
"type": "markdown",
"state": {
"file": "10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593952 - Regular Languages.md",
"mode": "source",
"source": false
},
"icon": "lucide-file",
"title": "29593952 - Regular Languages"
}
}
],
"currentTab": 1
@@ -199,10 +213,10 @@
},
"active": "e179fd2c20f4067e",
"lastOpenFiles": [
"10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593940 - Formal Languages.md",
"00 Inbox/29593975 - Regular Expressions.md",
"10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593852 - Strings.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/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",
"30 Library/29593962 - atfl-st2026-l02-finite-representation-of-languages-full.pdf",
"30 Library/normalize_name.sh",

2
00 Inbox/29593975 - Regular Expressions.md
View File

@@ -29,3 +29,5 @@ A _regular expression_ $r$ over an alphabet $Sigma$ is defined recursively:
> The language $L$ over $Sigma = {a, b}$ containing the substring $a b$ is regular, since it can be expressed using the regular expression
> $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)$).

6
10 Courses/02 - SoSe 2026/Automatentheorie und formale Sprachen/29593952 - Regular Languages.md
View File

@@ -17,4 +17,8 @@ tags:
## 📝 Content
A language $L$ that can be described by a regular expression $r$ (i. e. $L(r) = L$) is called _regular_.
A language $L$ that can be described by a [[29593975 - Regular Expressions|Regular Expression]] $r$ (i. e. $L(r) = L$) is called _regular_.
> [!WARNING]
> There a several important languages that **cannot** be described by a regular expression.
> <mark style="background: #CACFD9A6;">(proof later)</mark>