Theory Of Computation 10,DFA of strings which contains 'a'

In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} where each string contains an 'a'.

Automata Theory,Gate Computer Scince,Regular Languages And Finite Automata Context Free Languages And Push Down Automata,Recursively Enumerable Sets And Turing Machines Undecidability,Theory Of Computation,Dfa Nfa Grammars Parse Tree,Deterministic Finite Automaton,String,