CmpE 350 - Formal Languages and Automata Theory

Spring Semester 2004

 


 

Announcements

 


 

Old Announcements

       HKD 301 (A-K) and YD 116 (L-Z)

       HKD 301 (A-K) and YD 116 (L-Z)

       HKD 301 (A-K) and YD 116 (L-Z)


 

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.

Instructor:

Prof. Dr. Cem Say

Assistants:

Itır Barutçuoğlu, Albert Ali Salah

 

Prerequisite:

CmpE 220

Topics:

  1. Strings and Languages
  2. Finite Automata and Regular Expressions
  3. Properties of regular sets
  4. Context free grammars
  5. Push-down automata
  6. Properties of context free languages
  7. Turing Machines

Midterm dates: (midterms will be held during the lecture hours)


10 March 15:00-17:00
7 April 15:00-17:00
12 May 15:00-17:00

 

Midterm places:

 

HKD 301 (A-K) and YD 116 (L-Z)

Computer Usage:

None

Laboratory projects:

None.