diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json index a618de9..631cac7 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-14.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-14.md", "mode": "source", "source": false } @@ -85,7 +85,7 @@ "state": { "type": "backlink", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-14.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-14.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-14.md", + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-14.md", "linksCollapsed": false, "unlinkedCollapsed": true } @@ -125,7 +125,7 @@ "state": { "type": "outline", "state": { - "file": "UNB/Year 4/Semester 2/CS3873/2024-02-14.md" + "file": "UNB/Year 4/Semester 2/CS2333/2024-02-14.md" } } }, @@ -158,8 +158,9 @@ }, "active": "c6e1f6f3797edf57", "lastOpenFiles": [ - "UNB/Year 4/Semester 2/STAT2593/2024-02-14.md", "UNB/Year 4/Semester 2/CS3873/2024-02-14.md", + "UNB/Year 4/Semester 2/CS2333/2024-02-14.md", + "UNB/Year 4/Semester 2/STAT2593/2024-02-14.md", "gcm-diagnose.log", "UNB/Year 4/Semester 2/CS2333/2024-02-12.md", "UNB/Year 4/Semester 2/CS3873/2024-02-12.md", @@ -185,7 +186,6 @@ "UNB/Year 4/Semester 2/CS2333/2024-02-05.md", "UNB/Year 4/Semester 2/CS3873/2024-02-05.md", "UNB/Year 4/Semester 2/CS3873/2024-02-02.md", - "UNB/Year 4/Semester 2/CS2333/2024-02-02.md", "Semester 2/STAT2593/Untitled", "Semester 2/STAT2593", "Semester 2", diff --git a/UNB/Year 4/Semester 2/CS2333/2024-02-14.md b/UNB/Year 4/Semester 2/CS2333/2024-02-14.md new file mode 100644 index 0000000..6c92a67 --- /dev/null +++ b/UNB/Year 4/Semester 2/CS2333/2024-02-14.md @@ -0,0 +1,8 @@ +Lecture Topic: Proofs + +For any DFA, we already have an NFA, it just not happen to use any characteristics of NFAs like epsilon transitions or more/less than 1 transition per symbol per state + +Suppose we have an NFA N that accepts language L +We can construct a DFA D that accepts the same language +* The DFA keeps track of all the possible states the NFA could be in after seeing any sequence of input symbols +Example in slides \ No newline at end of file