Resources to get better at theoretical CS?
I was wondering if the HN community could suggest resources that might be helpful for getting over the hump on understanding theoretical CS.
To provide perspective, I'm a first year master's student in CS with a focus on cybersecurity. We are all required to take what is basically an advanced automata course. Undergrad automata was a while ago, and while I'm getting my feet again with DFAs and NFAs and regular expressions, I'm getting more and more lost as we move to more advanced material that either wasn't covered in undergrad or was only touched upon.
Thanks!
15 comments
[ 7.1 ms ] story [ 74.4 ms ] threadhttps://github.com/ossu/computer-science
https://www.amazon.com/Introduction-Theory-Computation-Micha...
As a CS professor myself I've been entertaining this idea for a part-time thing, but I don't know how many people could be interested on a service like this.
- a weekly correspondence would be nice but could be as simple as as an email/report
- a monthly meeting/call/video session partnered with the weekly email/report would probably be crucial to ensure the 'student' was being held accountable for producing results.
My professor is very helpful, but office hours and schedules can only mesh so much. I'm mainly looking for things I can supplement with to fill in any holes.
Regular Expressions I learned from these course notes on matching/staging (assume you know basic set theory notation) http://www.cs.cmu.edu/~15150/previous-semesters/2012-spring/... and the accompanying chapters in Programming in Standard ML by Robert Harper http://www.cs.cmu.edu/~rwh/isml/book.pdf where you debug regexp