| Course Title | Code | Language | Type | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|---|---|
| Formal Languages And Abstract Machines | CE301 | Turkish | Compulsory | 5. Semester | 3 + 0 | 3.0 | 5.0 |
| Prerequisite Courses | |
| Course Level | Undergraduate |
| Mode of delivery | Expression, Practising, Q&A, Discussion, Problem Solving |
| Course Coordinator | Dr. Öğr. Üyesi Esra ŞATIR |
| Instructor(s) | Dr. Öğr. Üyesi Esra ŞATIR (Güz) |
| Goals | To understand the mathematical methods related to the design of programming languages and to make possible the design of tools for accepting a program written in a certain language. |
| Course Content | Basic mathematics for languages, Regular expressions, deterministic and nondeterministic automatas, grammar and languages, regular landuages, context free grammar, normal forms and optimization of grammars, Cumulative automatas, Turing machines, parsing operations,classification of languages, Shift-Reduce and Recursive-Descent parsing methods |
| # | Öğrenme Kazanımı |
| 1 | Defining a Language |
| 2 | Language sets and regular expressions |
| 3 | Regular sets abd automata theory |
| 4 | Understanding language design and deterministic finite automata |
| 5 | Understanding language design and non deterministic finite automata |
| 6 | Using transition graphs for language design |
| 7 | Using Moore-Mealy Machines for language design |
| 8 | Context Free Language |
| 9 | Language Tree and Parsing |
| 10 | Push Down Automata |
| 11 | Turing Machines |
| Week | Topics/Applications | Method |
|---|---|---|
| 1. Week | Regular and Non Regular Languages | |
| 2. Week | Mathematical Notations and Techniques | |
| 3. Week | Regular expressiond and regular languages | |
| 4. Week | Deterministic Finite Automata | |
| 5. Week | Nondeterministic Finite Automata | |
| 6. Week | Transition Graphs | |
| 7. Week | FA with Output | |
| 8. Week | Context Free Grammars and Languages | |
| 9. Week | Normal Forms | |
| 10. Week | Pushdown Automatas | |
| 11. Week | Turing Machines | |
| 12. Week | Turing machine examples | |
| 13. Week | Parsing (Top-Down Parsing) | |
| 14. Week | Parsing (Top-Down Parsing) |
| Program Requirements | DK1 | DK2 | DK3 | DK4 | DK5 | DK6 | DK7 | DK8 | DK9 | DK10 | DK11 |
|---|
| Ders Kitabı veya Notu | Ders Kitabı veya Ders Notu bulunmamaktadır. |
|---|---|
| Diğer Kaynaklar |
|
| ECTS credits and course workload | Quantity | Duration (Hour) | Total Workload (Hour) | |
|---|---|---|---|---|
|
Sınavlar |
Midterm 1 | 1 | 1 | 1 |
| Final | 1 | 1 | 1 | |
| Classroom Activities | 1 | 1 | 1 | |
| Total Workload | 3 | |||
| *AKTS = (Total Workload) / 25,5 | ECTS Credit of the Course | 5.0 | ||
