The normal prerequisite is at least an undergraduate course in automata theory, such as EECS 361. You should be very familiar with the basics of regular and context free languages, and the machines that accept them. We will begin with a fast review of Turing machines.
See me if you lack this background.