CmpE
350 - Formal Languages and Automata Theory
Spring
Semester 2005
Announcements
- The
fınal exam results are here. You may see
your papers on June 20, 2005 Monday between 10:30 and 11:00 at ETA 401.
- The
third midterm results are here. You may see your
papers on June 06, 2005
Monday after the PS.
- The
second midterm results are here. You may see
your papers on May 11, 2005 Wednesday between 10:00 – 12:00 or after the
PS next week.
- Midterm III: May 11, 2005 - 15:00 - 17:00
HKD 201
HKD 301
- Midterm II: April 13, 2005
HKD 201
HKD 301
- The
midterm results are here. (updated after
objections)
- The
first problem session is on February 28, Monday between 16:00-17:00 at ETA
Z04.
- The
PS will be held on Mondays, 16:00-17:00, at ETA Z04.
- 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:
- Strings and Languages
- Finite Automata and Regular
Languages
- Context-free Languages
- The Church-Turing Thesis
- Decidability
- Reducibility
Midterm dates:
March 16, April 13, May 11
Midterm places:
HKD 201, HKD 301
Computer Usage:
None
Laboratory projects:
None.
Assistants:
Albert Ali Salah, Itır Karaç