تماشای ویدئو Theory Of Computation 27DFA which accepts strings anbmclnml greater than equal to 0 از آی-ویدئو
In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} L={ a^nb^mc^l/n,m,l greater than equal to 0}