1

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?

Drimades Boy
  • 489
  • 3
  • 10

2 Answers2

2

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.

lfalin
  • 446
  • 2
  • 6
1

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

Ben I.
  • 32,726
  • 11
  • 68
  • 151
  • Do you know of any set of slides based on Sipser's book? – Drimades Boy Jul 16 '20 at 19:44
  • @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. – Ben I. Jul 17 '20 at 04:38