Assignment-1

1. DFA which accepts strings of odd length

2. Design a DFA over w {a,b}* such that number of a = 2 and there is no restriction over
length of b
3. DFA for Number of a(w) mod 2 = 0 and Number of b(w) mod 2 = 0
4. DFA for Number of a(w) mod 2 = 0 or Number of b(w) mod 2 = 0
5. DFA for Number of a(w) mod 2 != 0 and Number of b(w) mod 2 != 0
6. DFA for Number of a(w) mod 3= 0 and Number of b(w) mod 3= 0
7. DFA for Number of a(w) mod 3 > Number of b(w) mod 3
8. DFA for binary number divisible by 2
9. DFA for binary number divisible by 3
10. DFA in which set of all strings can be accepted which start with a
11. DFA in which set of all strings can be accepted which contains a
12. DFA in which set of all strings can be accepted which end with a
13. DFA in which set of all strings can be accepted which start with ab
14. DFA in which set of all strings can be accepted which contain ab
15. DFA in which set of all strings can be accepted which ends with ab
16. DFA in which start and end symbol must be different
17. Design a DFA in which start and end symbol must be same
18. DFA in which every 'a' should be followed by 'b'
19. DFA in which every 'a' should never followed by 'b'
20. DFA in which every 'a' should followed by 'bb'
21. DFA in which every 'a' should never followed by 'bb'
22. DFA for anbm | n,m 1
23. DFA for anbm | n,m 0
24. DFA for anbmcl | n,m,l 1
25. DFA for anbmcl | n,m,l 0
26. DFA such that second symbol from L.H.S. should be 'a'