Languages
1
, Equivalence of Machines
Definition for Automata:
Machine M1 is equivalent to machine M 2
if LM1 LM 2
2
, Example of equivalent machines
NFA M1
0
LM1 {10} *
q0 q1
1
DFA M2 0,1
0
LM 2 {10} *
q0 q1 1 q2
1
0
3
, We will prove:
Languages
Regular
accepted
Languages
by NFAs
Languages
accepted
by DFAs
NFAs and DFAs have the
same computation power
4