How exactly do you become good at Theory of computation? I think I understand the concepts of finite automata, context free languages, pushdown automata but when it comes to exam questions, a lot of it comes down to making these FA or NDPAs etc etc which seems like it requires ingenuity or some trick..

Is there something I am missing? How do I become good at this shit? Is it just a matter of practice and doing many questions so that I will have them all memorized? I've been re-reading my notes on structural induction and graph theory trying to see if there is something I missed..