A BIG THANKYOU SIR! At first I just hated flat subject and thought I couldn't even pass, but now only because of you I have learned all the units and make it easier for me.
Sir in dfa transition table we should include all new combinations along with nfa states given in question no sir,but you took only 1 given input state sir,plz solve my doubt
we have to include every new combination which is obtained by applying input on a state, no need to include all the combinations. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.
In the problem q0 is given as final state. So the states which contains q0 is final state. q0q1 contains q0. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Ya sure. I got in an accident. May be from aug 3rd week i will start uploading videos. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
