Introduction to the Theory of Computation

[401/84%]

M. Sipser

Part IAutomata and Languages[132/83%]

Chapter 1Regular Languages[73/75%]

Chapter 2Context-Free Languages[59/92%]

Part IIComputability Theory[118/98%]

Chapter 3The Church-Turing Thesis[22/95%]

Chapter 4Decidability[32/97%]

Chapter 5Reducibility[36/100%]

Chapter 6Advanced Topics in Computability Theory[28/100%]

Part IIIComplexity Theory[136/73%]

Chapter 7Time Complexity[54/96%]

Chapter 8Space Complexity[34/91%]

Chapter 9Intractability[25/52%]

Chapter 10Advanced Topics in Complexity Theory[23/13%]

Chapter 0Introduction[15/87%]

Section 0.1Exercises[9/78%]

Section 0.2Problems[6/100%]