I noticed Standford have a 6-week course on automata starting on Monday. It intends to cover
Finite automata and regular expressions
Context-free grammars
Turing machines and decidability
The theory of intractability, or NP-complete problems
so I thought it might be of interest to those who have read Tom’s book!
http://online.stanford.edu/Automata_Fall_2014
Cheers,
Chris