CmpE 350 Formal Languages and Automata Theory 2016 Spring

Instructor: 

Course Schedule: 

WFF 334 BM A2

PS Schedule: 

WW 910 BM A2

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 13:00-15:00


Exam dates:
Midterm 1 :
 March 11 Friday, 11:00 AKALIN - KİREÇLİGÖL @ NH 402 // KURT - ZÖĞ @ NH 404
Midterm 2 : April 15 Friday, 11:00 @ NH 401


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.

Additional Material: 

PS Problems
PS1PS2PS3PS4PS5PS6PS7PS8, PS9, PS10, PS11

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.