Non-deterministic Finite Automata

Conversion of NFA to DFA

Conversion of NFA to DFA

DFA is contained an NFA, but not vice versa

But there is equivalent DFA for every NFA

Conversion of NFA to DFA Example 1

L1= Set of all strings over (0,1) that start with ‘0’
Alphabets={0,1}
0 1
0,1

A B &
0
A B B B B

DFA 0,1
C 0 1
1
A B C
0
A B B B B
C C C
Conversion of NFA to DFA Example 1

L1= Set of all strings over (0,1) that ends with ‘1’
Alphabets={0,1} 0 1

A A {A,B}
1
A B B & &
0,1

DFA
0 1

1
A A {(AB)}
1
A AB
AB A {(AB)}
0 0