NFA, DFA, and regular expressions - 204213 Theory of Computation

More documents

Recommendations

Info

Outline Review Nondeterminism Eq. of NFAs and DFAs Closure Reg.Ex. Eq. between Reg.Ex. and FAaProof of Theorem 2: dealing with ε (2)Consiser M at state R ∈ Q ′ .M simulates many copies of N at states in R.Define E(R) to be a collection of states reachable from anystates in R by traveling along 0 or more ε arrows.Formally, E(R) = {q| q can be reached from states in R bytraveling along 0 or more ε arrows }Combining these moves to the previous construction of δ ′ :
Outline Review Nondeterminism Eq. of NFAs and DFAs Closure Reg.Ex. Eq. between Reg.Ex. and FAaProof of Theorem 2: dealing with ε (2)Consiser M at state R ∈ Q ′ .M simulates many copies of N at states in R.Define E(R) to be a collection of states reachable from anystates in R by traveling along 0 or more ε arrows.Formally, E(R) = {q| q can be reached from states in R bytraveling along 0 or more ε arrows }Combining these moves to the previous construction of δ ′ :δ ′ (R, a) = ⋃ q∈RE(δ(q, a)).
Page 1 and 2:
Outline Review Nondeterminism Eq. o
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30: Outline Review Nondeterminism Eq. o
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162:
show all

NFA, DFA, and regular expressions - 204213 Theory of Computation

Create successful ePaper yourself

Delete template?

Save as template?