CSE 303 - Textbook and Topics

Textbook

• Wayne Goddard, Introducing the Theory of Computation. Jones and Bartlett Publishers, 2008. [ISBN 978-0-7637-4125-9]

Topics

• Regular Languages [Chapters 1-4]
  • Finite Automata [Chapter 1]
  • Regular Expressions [Chapter 2]
  • Nondeterminism [Chapter 3]
  • Properties of Regular Languages [Chapter 4]
• Context-free Languages [Chapters 6-9]
  • Context-free Grammars [Chapter 6]
  • Pushdown automata [Chapter 7]
  • Grammars and Equivalences [Chapter 8]
  • Properties of Context-Free Languages [Chapter 9]
• Turing Machines [Chapters 11-13]
  • Turing Machines [Chapter 11]
  • Variations of Turing Machines [Chapter 12]
  • Decidable Problems and Recursive Languages [Chapter 13]
• Undecidability [Selected parts of Chapters 14 and 15]
  • Diagonalization and the Halting Problem [Chapter 14]
  • More Undecidable Problems [Chapter 15]