CS 302 Formal Languages and Automata Theory
Introduction to languages, grammars and computation, Chomsky hierarchy, Regular languages and regular expressions, finite state automata and nondeterminism, automata determinization and minimization, pumping lemma and closure properties for regular languages, context free languages and grammars, push-down automata, pumping lemma for context-free languages, closure properties of context-free languages.
Alongside CS 302R
Opens up CS 407
Lecture — CS 302
| Section | When | Where | Instructor | CRN | |
|---|---|---|---|---|---|
| 0 | Tue 14:40–15:30 Fri 10:40–12:30 |
FASS 1050 FASS G018 |
Kemal İnan | 20216 | syllabus |
Recitation — CS 302R
| Section | When | Where | Instructor | CRN | |
|---|---|---|---|---|---|
| 0 | Tue 17:40–18:30 | FASS 1010 | Kemal İnan | 20217 | syllabus |
CS 302 — Sabancı Üniversitesi Spring 2026-2027 ders programı: section'lar, saatler, derslikler, CRN'ler ve syllabus bağlantıları.