1
$\begingroup$

The course includes: Regular Languages, Context-Free Languages, Turing Machines, Decidability, Reductions, etc. Do you know of any collection of problems/solutions suitable for a senior course?

$\endgroup$
2
$\begingroup$

I agree that Introduction to the Theory of Computation by Sipser is good text, but I also recommend taking a look at the Stanford CS103 course page archive, which has a lot of great supplementary resources, including handouts, problem sets, and lecture notes.

| improve this answer | |
$\endgroup$
1
$\begingroup$

The standard text is probably the Sipser book. It's fantastic, and the problem sets are quite intellectually rich.

| improve this answer | |
$\endgroup$
  • $\begingroup$ Do you know of any set of slides based on Sipser's book? $\endgroup$ – Drimades Boy Jul 16 at 19:44
  • $\begingroup$ @DrimadesBoy I don't particularly, but it shouldn't be hard to find. I'd start with syllabi that mention the text. Many professors post their slides by default. $\endgroup$ – Ben I. Jul 17 at 4:38

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.