Instructor: Dr. Inst. Nurdan Saran

Room: L - 219

Office Hour: Wednesday 14:20-15:10

Course Description: Introduction to strings, languages, and grammars. Concept of abstract machines and language acceptance. Deterministic and nondeterministic finite state machines. Regular expressions. Machines with pushdown tape. Context-free grammars and parse trees. Turing machines and recursive functions. Unrestricted grammars.

Textbook: Michael Sipser, Introduction to the Theory of Computation, Third International Edition, Cengage, 2013, ISBN: 978-1133187790.

Emre Sermutlu, Automata, Formal Languages, and Turing Machines, Cinius Publications, 2020, ISBN: 978-6257790956.

Reference Books: Peter Linz, An Introduction to Formal Languages and Automata, Jones & Bartlett Learning, 6th edition, 2016, ISBN: 978-1284077247.

Evaluation Criteria:

  • Class Works : %20
  • Midterm: %40
  • Final %40