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
Download Patch File Download Diff File Expand all files Collapse all files

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