Theory Of Computation 6, DFA construction of binary no which is divisible by 2 and number system

In this video I have discussed about Number System and how to construct a DFA which accepts set of all strings over {0,1} which when interpreted as binary number is divisible by 2.

• #تحصیلات_و_یادگیری
• #theory_of_computation
• #dfa_nfa_grammars_parse_tree
• #regular_languages_and_finite_automata_context_free_languages_and_push_down_automata