IsaacShoebottom/Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2024-02-14 12:52:33

Browse Source
This commit is contained in:
Isaac Shoebottom 2024-02-14 12:52:33 -04:00
parent 1667a30bba
commit e41c35cecd
2 changed files with 14 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
.obsidian/workspace.json vendored
View File

@ -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",

8
UNB/Year 4/Semester 2/CS2333/2024-02-14.md Normal file
View File

@ -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