Equivalence of NFAs & DFAs
Equivalence of NFAs & DFAs. Extended transition f n NFAs. Proving equivalence. Construct DFA D from NFA N. N = (Q N , , N ,q 0,N ,F N ) Construct D= (Q D , , D ,q 0,D ,F D ) such that, for any string w *, w is accepted by N iff w is accepted by M. Construction continued.
161 views • 6 slides