CmpE 350 - Formal Languages and Automata Theory

Spring Semester 2008

 


Announcements

TIME: 31 May 2008  10:30

PLACES:  (according to lastnames)

AĞAYEV – DURNA                        @ NH 404

EKİCİ – YÜCER                               @ NH 405

 

·         Midterm3 grades are here. You may see your papers on May, 28 2008 between 12:00 – 13:00 at ETA19

 

·         Midterm3      

TIME: 14 May 2008  10:00 – 12:00,

PLACES:  (according to lastnames)

AĞAYEV – DİNÇ                @ ETA A2

DİNLER – YÜCER               @HKD101 (Hisar Campus)

·         Midterm2 grades are here

·         Midterm2      

TIME: 9 April 2008  10:00 – 12:00,

PLACES:  (according to lastnames)

AĞAYEV – DİNÇ    @ ETA A2

DİNLER – YÜCER               @HKD101 (Hisar Campus)

 

·         Midterm grades are here

You may see your papers on April 7, 2008 Monday between 15:00 and 17:00 at ETA 47.

·         Midterm1      

TIME: 12 March 2008  10:00 – 12:00,

PLACES:  (according to lastnames)

AĞAYEV – DURNA            @ ETA A2

EKİCİ – YÜCER                   @HKD101 (Hisar Campus)

·         Problem Sessions will be held weekly on Mondays at ETA A2 between 17:00 -18:00.

 


 

Catalog Data:

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

Textbook:

Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 2nd Edition.

Instructor:

Cem Say

Teaching Assistants

Itır Karaç, Nuri Taşdemir

 

Prerequisite:

CmpE 220 or equivalent

Topics:

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

Midterm dates:

Midterm I        : 12 March 2008  10:00 – 12:00

Midterm II      : 9 April 2008 10:00 – 12:00

Midterm III     : 14 May 2008  10:00 – 12:00

Midterm places:  (According to the Lastnames)

ETA A2

HKD101 (Hisar Campus)

Computer Usage:

None

Laboratory projects:

None.