diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json index 6cdb9a8..8f8a6f5 100644 --- a/.obsidian/workspace.json +++ b/.obsidian/workspace.json @@ -13,7 +13,7 @@ "state": { "type": "markdown", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-09.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-09.md", "mode": "source", "source": false } @@ -85,7 +85,7 @@ "state": { "type": "backlink", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-09.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-09.md", "collapseAll": false, "extraContext": false, "sortOrder": "alphabetical", @@ -102,7 +102,7 @@ "state": { "type": "outgoing-link", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-09.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-09.md", "linksCollapsed": false, "unlinkedCollapsed": true } @@ -125,7 +125,7 @@ "state": { "type": "outline", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-09.md" + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-09.md" } } }, @@ -158,8 +158,9 @@ }, "active": "f37bd350f6063f55", "lastOpenFiles": [ - "UNB/Year 4/Semester 2/STAT2593/2024-02-09.md", "UNB/Year 4/Semester 2/CS3873/2024-02-09.md", + "UNB/Year 4/Semester 2/CS2333/2024-02-09.md", + "UNB/Year 4/Semester 2/STAT2593/2024-02-09.md", "UNB/Year 4/Semester 2/STAT2593/2024-02-07.md", "UNB/Year 4/Semester 2/STAT2593/2024-02-05.md", "UNB/Year 4/Semester 2/STAT2593/2024-02-02.md", @@ -183,7 +184,6 @@ "UNB/Year 4/Semester 2/CS2333/2024-01-24.md", "UNB/Year 4/Semester 2/CS3873/2024-01-24.md", "UNB/Year 4/Semester 2/CS3873/2024-01-22.md", - "UNB/Year 4/Semester 2/STAT2593/2024-01-24.md", "gcm-diagnose.log", "Semester 2/STAT2593/Untitled", "Semester 2/STAT2593", diff --git a/UNB/Year 4/Semester 2/CS2333/2024-02-09.md b/UNB/Year 4/Semester 2/CS2333/2024-02-09.md new file mode 100644 index 0000000..2a0b6e5 --- /dev/null +++ b/UNB/Year 4/Semester 2/CS2333/2024-02-09.md @@ -0,0 +1,11 @@ +Lecture Topic: More NFA + +Design a state diagram for an NFA that accepts +$$L = \{w \in \{a,b,c\}^* | \text{w starts with abc, ends with aab, and contains the substring bb}\}$$ +So, the first three states must be connecting a, b and c + +(D) -a, b, c> (D) +(F) -a, b, c> (F) +(A) -a> (B) -b> (C) -c> (D) -b> (E) -b> (F) -a> (G) -a> (H) -b> ((I)) + +It's important that on D and F, that b is allowed to loop, as if it did not, some valid strings would not be accepted, as it would only allow for two bs in the middle \ No newline at end of file