Semester: 2021 - 2022 FALL

Instructor: Dr. Inst. Emre SERMUTLU

Room: R - 201

Office Hours: Wednesday 13: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.

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

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

Evaluation Criteria:

  • First Midterm: %30
  • Second Midterm: %30
  • Final %40

 

Exam Dates:

  • First Midterm: November 09, 2021, Tuesday at 17:30.
  • Second Midterm: December 14, 2021, Tuesday at 17:30.
  • Final: January 19, 2022, Wednesday at 10:00.
    Room: M - 102, N - A02.
  • Make Up: January 24, 2022, Monday at 10:00.
    Room: R - B03
  • Resit (Bütünleme): February 02, 2022, Wednesday, at 10:00. Room L - A15