CmpE 350 - Formal Languages and Automata Theory

Spring Semester 2002

Announcements

  • The makeup exam is on Tuesday, 18 June, at 15:00, in ETA 203.

    Old Announcements

  • The final results are here. Due to the conflict with the HTR exam, the objection is postponed to Thursday, June 13.
  • The final is on 4th June, YD 406 (A - I) and YD 506 (K - Z).
  • Midterm 3: Thursday, May 23, 13:00-15:00 - HKD 201 (A - I) & HKD 301 (K - Z).

    Catalog Data:

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

    Textbook:

    P. J. Denning, J. B. Dennis, J. E. Qualitz. Machines, Languages and Computation. Prentice-Hall, 1978. Available in Seçkin.

    Instructor:

    Assoc. Prof. Cem Say

    Assistants:

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

     

    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. Context sensitive languages and LBA
    8. Turing Machines

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

    MT#1: March 21 - HKD 201 & HKD 301

    MT#2: April 18 - HKD 201 & HKD 301

    MT#3: May 23 - HKD 201 & HKD 301

    Computer Usage:

    None

    Laboratory projects:

    None.

     


    last updated: 18 June 2002