8 lines
426 B
Markdown
8 lines
426 B
Markdown
|
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
|