Theory of Computation20765 marksMethod for reduction of NFA to DFA
Construct a NFA accepting language of {0, 1} with each string ending with 01 and convert it into equivalent DFA.
Construct a NFA accepting language of {0, 1} with each string ending with 01 and convert it into equivalent DFA. [5]
Language: L = { w w ∈ {0,1} and w ends with 01 } Example strings: 01, 001, 101, 0001, 1101, ... We need 3 states: State Role ------------- q0 Start state (reading any symbol, staying in loop) q1 Just read '0' (possible start of ending "01") q2 Just read '01' -- Final/Accept state More precisely: ...