DFA Examples 7 || Set of all strings Containing '1100' as substring || FLAT ||Theory of computation

Plz Subscribe to the Channel and if possible plz share with your friends. Thanks in advance

#dfasubstring #toc #theoryofcomputation

[tharunialampali]

This explanation really helped me before my exam! Thank you for these examples

[MamidalaVaishnavi]

sir, how you are saying that back tracking q3 to q1 is best can we back track q3 to q2 or q0 please answer sir

[lohithaadapala]

Sir Thankyou, but one doubt for q4 state when input 0, 1 is applied it is going to same state q4 but in dfa it should go to single state only know.

[NIVEDITHAMaycs]

sir cant we backtrack to q2 from q3 for 1 instead of backtracking to q1

[manvithyadavofficial]

Sir in 1100 problem why we dont take one dead state for all remaing charector from each state means 0 or 1)

[Spypop]

Sir can we take a dead state in this sum...pls reply sir .. tomorrow is my exam 😊