Finite automata, regular expressions, regular languages and their properties, the pumping lemma. Context free grammars and languages, normal forms, pushdown automata, the pumping lemma for the CFLs. Turing machines and their properties. Decidability and undecidable languages. Complexity theory, NP-completeness.
İlk dosyayı sen ekleyebilirsin — notlar, geçmiş finaller, çözümler, cheat-sheet, ne varsa. Drive linki / PDF / ZIP / fotoğraf, hepsi olur.
Şu an: mail at, ben düzenleyip yayına alayım. Form/upload UX yakında geliyor (Kimya tasarlıyor).
| Dönem | Course CPA | |
|---|---|---|
| 2025-2026 Fall | 2.16 | 1 sec · 79 öğr |
| 2024-2025 Fall | 2.54 | 1 sec · 65 öğr |
| 2024-2025 Spring | 2.37 | 2 sec · 167 öğr |
| 2023-2024 Fall | 2.05 | 1 sec · 74 öğr |
| 2023-2024 Spring | 2.43 | 2 sec · 134 öğr |
| 2022-2023 Fall | 2.06 | 1 sec · 75 öğr |
| 2022-2023 Spring | 2.07 | 2 sec · 160 öğr |
| 2021-2022 Fall | 1.98 | 1 sec · 76 öğr |
| 2021-2022 Spring | 2.28 | 2 sec · 130 öğr |
| 2020-2021 Fall | 2.20 | 2 sec · 77 öğr |
Aggregate course GPA — Bilkent STARS'tan public data. Hoca-bazlı per-section detayı için STARS evaluation report →. Öğrenci anket cevapları KVKK kapsamında defter'de tutulmaz.
(Classworks' Average x 0.3) + (Midterm x 0.25) should be at least 18 (out of 55).
Finite automata Cntd Regular expressions and languages Cntd Context-free grammars and languages Cntd Pushdown automata Midterm Exam Turing machines Cntd Decidability Cntd Complexity theory and NP-completeness Selected topics ECTS - Workload Table: Activities Number Hours Workload Midterm exam 1 2 2 Preparation for Final exam 1 25 25 Individual or group work 14 2 28 Preparation for Midterm exam 1 20 20 Quiz 6 1,5 9 Final exam 1 3 3 Course hours 14 3 42 Preparation for Quiz 6 3 18 Total Workload: 147 Total Workload / 30: 147 / 30 4.9 ECTS Credits of the Course: 5 Type of Course: Lecture Course Material: Written Teaching Methods: Assignment - Lecture - Practical session