I'm taking an Automata Theory class and the class is using pic related. So far the class has gone over DFAs, regular expressions and NFAs but I noticed I have almost no intuition about them. At a conceptual level I understand what they're, how a DFA processes a word, equivalence among DFAs, NFAs and regular expressions but I struggle to come up with a correct answer when presented with a problem.
I recognize I'm a brainlet but I like the topic and would like to learn more about it and pass the class.

Any advice, /sci/?