Automata, Computation & Complexity

Lecture Notes & Resources:

v Lesson 0a – TheoryofComputation&Languages (Chapter 1, 2 & 3)

v Lesson 0b – TheoryofComputation&Languages_Readings&Exercises

v Lesson 1a – RegularLanguages_FSM (Chapter 5)

v Lesson 1b – RegularLanguages_RE_RG (Chapter 6 & 7)

v Lesson 1c – RegularLanguage_NotRL_CP_DP (Chapter 8 & 9)

v Lesson 1d – RegularLanguages_Readings&Exercises

v Lesson 2a – ContextFreeLanguage_CFG (Chapter 11)

v Lesson 2b – ContextFreeLanguage _PDA (Chapter 12)

v Lesson 2c – ContextFreeLanguage _NotCFL_CP_DP (Chapter 13 & 14)

v Lesson 2d – ContextFreeLanguages_Readings&Exercises

v Lesson 3a – Computability_TM (Chapter 17)

v Lesson 3b – Computability_ChurchTuringThesis_HaltingProblem (Chapter 18 & 19)

v Lesson 3c – Computability_D_SD_Undecidability (Chapter 20 & 21)

v Lesson 3d – Computability_Readings&Exercises

v Lesson 4a - Complexity (Chapter 27)

v Lesson 4b – Complexity_TimeComplexity (Chapter 28)

v Lesson 4c - Complexity_SpaceComplexity (Chapter 29)

v Lesson 4d – Complexity_Readings&Exercises

ü Textbook: Automata, Computability and Complexity: Theory & Application