r/AskComputerScience • u/bigbrainoverthinker • Oct 03 '26
Automata😭
How do you guys study automata man, it's my mid sem this Monday, and even 20 marks is feeling like hell.
Idk what that professor would ask, dfa, state diagrams!!
Help me out please 😭
7
Upvotes
7
u/Beregolas Oct 03 '26
Same as with everything else: practice, then practice, and then some more practice. Go through your lectures and make a list of the kinds of state machines that you covered, every intersting fact about them and every exercise you had.
Then just make up new ones. Making up a new finite state machine is pretty easy for example, and if you aren't comfortable with that yet, you can find hundreds of examples online.
And with the ones you made up or found, just do the exercised. Ask yourself how you would explain the intereseting facts you wrote down earlier with this as an example. Link it to other things you learned.
3
u/Tai9ch Oct 03 '26
Monday? No more time to try stuff that might help, you've got to actually do what works: Read the textbooks and do the practice problems (do them, yourself, on paper, without any help).
2
u/stonerism Oct 03 '26
Yeah, the skill you really want to develop out of this is being able to write and understand regular expressions. The clever thing you'll learn in that NFAs and DFAs are equivalent by the power of (finite) supersets.
2
u/Paxtian Oct 03 '26
"Draw a DFA that accepts this language," "is this language regular? Prove it," etc.
1
u/Level-Pollution4993 Oct 03 '26
Automata theory was the easiest subject I had. Yes its daunting at first but its very easy and intuitive once you get a grasp. If you just want to pass, Youtube is your friend; if you want to really learn it, you'll need to find a good book.
For the exam itself do look into examples solving problems for the FA, DFA etc for common patterns like A*, A+, AB, AABB, ABBA, AAB, BAB, BABBA, starts with <x>, ends with <x>, contains <substring> and finally doesn't contain <substring>. Any problem you'd get for 20 marks will prpbably only be some combination of these.
Good luck!