If the DFA doesn’t have a transition for any symbol, it can go to a dead/trap state, qD. So in the example explained in video, the following transitions can be included, instead of ϕ.
δ({ q1, q2 },a) = qD
δ({ q2 },a) = qD
δ({ q2 },b) = qD
From the state qD, all input symbols go to same state.
δ (qD, a) = qD
δ (qD, b) = qD
δ (qD, c) = qD
Негізгі бет Theory of Computation: Conversion of Epsilon-NFA to DFA
Пікірлер: 248