design DFA and NDFA for each example a(a+b)*a DFA for the language of all those strings starting and ending with different letters DFA for the language of all those strings having double 0 or double 1...

design DFA and NDFA for each example

1. a(a+b)*a


2. DFA for the language of all those strings starting and ending with different letters


3. DFA for the language of all those strings having double 0 or double 1


4. DFA for ending with b


5. DFA for strings having triple a’s or triple b’s


6. DFA for All strings which do not contain the substring ba.


7. DFA for all strings that do not end with aa.


8. DFA for Yx(x+y)*


9. DFA for all strings starting with b


10. Construct a DFA that accept a string over {a,b} that does not contain aabb

Note: this is related from TOA subject.