Question

Consider the following NFA: Informally describe the language accepted by the NFA. Convert the NFA into a DFA.

Answer 1

steps to convert NFA to DFA are: 1.Create state table from the given NDFA.

2.Create a blank state table under possible input alphabets for the equivalent DFA.

3.Mark the start state of the DFA by q0 (Same as the NDFA).

4.Find out the combination of States {Q0, Q1,... , Qn} for each possible input alphabet.

5.Each time we generate a new DFA state under the input alphabet columns, we have to apply step 4 again, otherwise go to step 6.

6.The states which contain any of the final states of the NDFA are the final states of the equivalent DFA. PFA image for the complete steps of conversion. (a) For a state q and string w, *(p, q ) is the set of states that the NFA can reach when it reads the string w starting at the state p. In general an NFA non-deterministically goes through a number of states from the state p as it reads the symbols in the string q. s フ S-S 수) 2 오