Build a DFA for the following language: L = { w | w is a string over a , and b starts ( aa or bb ) and ends with ( aa or bb ) L = { w | w is a binary string that has even number of 1s and even number...

Build a DFA for the following language:

• L = { w | w is a string over a , and b starts ( aa or bb ) and ends with ( aa or bb )


• L = { w | w is a binary string that has even number of 1s and even number of 0s}


• The set of all strings whose tenth symbol from the left end is a 1.


• The set of strings that either begin or end (or both) with 01


• Let = Σ ={0,
  1} , Give DFA's accepting The set of all binary string , which are divisible by 3.


• Let = Σ ={0,
  1} , Give DFA's accepting The set of all binary string , which are divisible by 5.


• Let = Σ ={0,
  1} , Give DFA's accepting The set of all binary strings start with 1 , and divisible by 5.