CmpE 350 Formal Languages and Automata Theory 2017 Spring

Instructor: 

Course Schedule: 

MFF 323

PS Schedule: 

TT 910

Course Program: 

Instructor: Cem SAY
Room: BM 39
E-mail: sayatboun.edu.tr (say[at]boun.edu.tr)


Teaching Assistant: Özlem Salehi
Room: BM 26
E-mail: ozlem.salehiatboun.edu.tr (ozlem.salehi[at]boun.edu.tr)
Office Hour: Wednesday 11:00-13:00


Exam dates:
Midterm 1 :
 March 10, Friday 10:00-12:00 @ NH101, NH103 
Midterm 2 : April 14, Friday 10:00-12:00 @ NH101, NH103
Final : June 1, Thursday 10:00-12:00 @ NH301, NH302


Catalog Data: Strings and Languages. Classification of Grammars. Finite-state automata and regular expressions. Push-down automata and context-free grammars. Turing machines.
Topics:

  1. Strings and Languages
  2. Finite Automata and Regular Languages
  3. Context-free Languages
  4. The Church-Turing Thesis
  5. Decidability
  6. Reducibility

Prerequisite: CmpE 220 or equivalent

Textbook: 

Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 3rd Edition.

Contact us

Department of Computer Engineering, Boğaziçi University,
34342 Bebek, Istanbul, Turkey

  • Phone: +90 212 359 45 23/24
  • Fax: +90 212 2872461
 

Connect with us

We're on Social Networks. Follow us & get in touch.