I'm an MS CompSci student in my final semester. I'm taking a finite automata and formal languages theory and a fair amount of the homework (at least, 3 weeks in) is proof based. I know what a proof "is", and I know how induction and case-based examples generally work... It just feels like when I'm done, I'm not truly sure if it's a "good proof" (even in scenarios where I am certain that I'm right).

Anybody run into this? I'm a math-tard but even I don't get good objective vibes out of some proofs I'm writing.