Struggling with Formal language automata theory
My teacher isn't the best for this course and no one in my class is able to understand anything
What resources are available because youtube isn't really helping me
I’m currently on a Theory of Computation with questions on DFAs, NFAs, regular expressions, language operations, and Kleene star. I’m mainly struggling with tracing the automata and understanding how to derive the answers rather than just selecting the options. Could someone help explain the approach to solving these questions and where can I learn better about them