CmpE 350 - Formal Languages and Automata Theory

Spring Semester 2006

 

 

Announcements

Time: 29.05.2006 – 9:30

Place: HKD 101 : A - G

          HKD 201 : H - Z    

  • Second midterm results are here. You may see your papers on May 22, Monday between 14:00 – 15:00 at HKC 204.
  • Midterm results are here.
  • Problem Sessions will be held on Wednesdays between 14:00 and 15:00 at YD 006. The first PS will be on March 15, 2006. 
  • Please register with the CmpE 350 mailing list from the department web site.
  • The course announcements will be placed here, newer ones will be on top of older ones. Check frequently.

 

 

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, 1997.

Instructor:

Cem Say

 

 

 

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:

29 March 2006  15:00 – 17:00

26 April 2006  15:00 – 17:00

Midterm places:

HKD 101 & HKD 201

Computer Usage:

None

Laboratory projects:

None.

Assistants:

Cem Keskin, Itır Karaç