Sir naku doubt undi sir ..... Nfa lo backtracking untunda undada sir... Konni sites lo emo backtracking is not always possible ani undi sir Konni sites lo emo backtracking is may or may not required ani undi Anduku confusion ga undi edi correct anedi artam kakundi sir
TQ sir everything solve i searched so many videos but doubt solved here
Good teaching skills
you are the absolute best
7:55 1001 is not satisfying this diagram right?
Superb sir
Sir in example 2 is it necessary to draw transition for 0 and 1 from Qo because each state can have 0 or more transitions right?
Thanks
Sir naku doubt undi sir .....
Nfa lo backtracking untunda undada sir...
Konni sites lo emo backtracking is not always possible ani undi sir
Konni sites lo emo backtracking is may or may not required ani undi
Anduku confusion ga undi edi correct anedi artam kakundi sir
How can we write the language?
by reading the condition given in the question
in the last question which is ends with 01....what will be the the NFA for 01001
It will not move for the initial inputs, because 0,1 can be self for Q⁰ and then move to the final state with last 01
Hi arooba i am stuck in these nfa and dfa and still i am not clear watching this video and other videos can you help me if you know this ?
sir in end with 01 question /
why id u put the self loop for the first state and the thing will that be applicaple for 001 state?
yes it is applicable..it should ends with 1..condition is satisfied
I understand ur question bro but it question is successfully not applicable😂
Its wrong....you have to put loop'0' on q1
It is not compulsory brother condition is given here start with 01 that's only he did not written