1]general ->

2011:
1] http://gateoverflow.in/2110/gate2011_8
2] Identify class language:
2011:
1] http://gateoverflow.in/2128/gate2011_26
3] minimal state automata ->
2011:
1] http://gateoverflow.in/2144/gate2011_42
2] http://gateoverflow.in/2147/gate2011_45
4] finite automata ->
2012:
1] http://www.geeksforgeeks.org/automata-theory-set-2/
2]http://gateoverflow.in/2159/gate2012_46
2013:
1] http://gateoverflow.in/1417/gate2013_8
5] Decidability ->
2012:
1] http://gateoverflow.in/1608/gate2012_24 ->
http://www.geeksforgeeks.org/automata-theory-set-2/
2] 25 -> http://www.geeksforgeeks.org/automata-theory-set-2/
6] Turing Machine
2013:
1] http://gateoverflow.in/1439/gate2013_17
http://quiz.geeksforgeeks.org/gate-gate-cs-2013-question-17/

Notes:
1] Automata
Difference between epsilon and phi in automata:
(https://www.quora.com/What-is-the-difference-between-epsilon-and-phi-in
-Automata)
2] Turing Machine
Turing Decidable and Recognizable Languages:
http://www.radford.edu/~nokie/classes/420/Chap3-Langs.html
------------------------------------------------Reading peter Linz:
Chapt 2. read DFA and solving drill exercise (done)
chap 6. read Chomsky hierarchy and solve drill exercises (halfway through)