Computer Engineering
Course Details
KTO KARATAY UNIVERSITY
Faculty of Engineering and Natural Science
Programme of Computer Engineering
Course Details
Faculty of Engineering and Natural Science
Programme of Computer Engineering
Course Details
| Course Code | Course Name | Year | Period | Semester | T+A+L | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| 05061102 | Formal Languages And Automata Theory | 2025 | Spring | 6 | 3+0+0 | 3 | 5 |
| Course Type | Elective |
| Course Cycle | Bachelor's (First Cycle) (TQF-HE: Level 6 / QF-EHEA: Level 1 / EQF-LLL: Level 6) |
| Course Language | Turkish |
| Methods and Techniques | - |
| Mode of Delivery | Face to Face |
| Prerequisites | - |
| Coordinator | - |
| Instructor(s) | Asst. Prof. Neşe ÖZKAN YILMAZ |
| Instructor Assistant(s) | - |
Course Instructor(s)
| Name and Surname | Room | E-Mail Address | Internal | Meeting Hours |
|---|---|---|---|---|
| Assoc. Prof. Ali ÖZTÜRK | A-124 | [email protected] | 7585 | Monday 14.00-15.00 |
Course Content
Classification of automata and formal languages. Finite state machines: Mealy ve Moore models, regular languages and their limitations. Tape automata. Push-down automata and context-free grammars. Normal-form grammars. Context-sensitive languages. Turing machines, halting problem and unsolvability. Recursive functions.
Objectives of the Course
A broad understanding of the finite state machine concepts. A broad understanding of syntax analysis and parsing concepts and methods. A knowledge of the basis of compiler design
Contribution of the Course to Field Teaching
| Basic Vocational Courses | |
| Specialization / Field Courses | |
| Support Courses | X |
| Transferable Skills Courses | |
| Humanities, Communication and Management Skills Courses |
Relationships between Course Learning Outcomes and Program Outcomes
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Program Learning Outcomes | Level |
|---|---|---|
| P1 | Adequate knowledge in mathematics, science and related engineering discipline accumulation; theoretical and practical knowledge in these areas, complex engineering the ability to use in problems. | 5 |
| P4 | Ability to develop, select and use modern techniques and tools for the analysis and solution of complex problems encountered in engineering applications; ability to use information technologies effectively | 4 |
| P9 | To act in accordance with ethical principles, professional and ethical responsibility; Information on the standards used in engineering applications | 3 |
Course Learning Outcomes
| Upon the successful completion of this course, students will be able to: | |||
|---|---|---|---|
| No | Learning Outcomes | Outcome Relationship | Measurement Method ** |
| O1 | Knowledge of at least one structured programming language. | P.3.11 | 7 |
| O2 | Designing computer engineering projects. | P.5.5 | 7 |
| O3 | Ability to convey field knowledge in written and oral form | P.7.11 | 1 |
| ** Written Exam: 1, Oral Exam: 2, Homework: 3, Lab./Exam: 4, Seminar/Presentation: 5, Term Paper: 6, Application: 7 | |||
Weekly Detailed Course Contents
| Week | Topics |
|---|---|
| 1 | Overview |
| 2 | Induction, Relations, Countability, Diagonalization |
| 3 | Introduction to Formal Languages |
| 4 | Finite Automata |
| 5 | Regular Experssions |
| 6 | Properties of Regular languages |
| 7 | Midterm |
| 8 | Context Free languages |
| 9 | Pushdown Automata |
| 10 | Pumping Lemma and other properties of CFL |
| 11 | Non-context free language |
| 12 | Turing Machines |
| 13 | Applications |
| 14 | Exam |
Textbook or Material
| Resources | Introduction to Computer Theory, by Daniel I.A. Cohen, (2nd Edition), Wiley, (1997) |
Evaluation Method and Passing Criteria
| In-Term Studies | Quantity | Percentage |
|---|---|---|
| Attendance | - | - |
| Laboratory | - | - |
| Practice | 1 | 10 (%) |
| Course Specific Internship (If Any) | - | - |
| Homework | - | - |
| Presentation | - | - |
| Projects | - | - |
| Quiz | - | - |
| Midterms | 1 | 40 (%) |
| Final Exam | 1 | 50 (%) |
| Total | 100 (%) | |
ECTS / Working Load Table
| Quantity | Duration | Total Work Load | |
|---|---|---|---|
| Course Week Number and Time | 14 | 3 | 42 |
| Out-of-Class Study Time (Pre-study, Library, Reinforcement) | 14 | 3 | 42 |
| Midterms | 1 | 32 | 32 |
| Quiz | 0 | 0 | 0 |
| Homework | 0 | 0 | 0 |
| Practice | 0 | 0 | 0 |
| Laboratory | 0 | 0 | 0 |
| Project | 0 | 0 | 0 |
| Workshop | 0 | 0 | 0 |
| Presentation/Seminar Preparation | 0 | 0 | 0 |
| Fieldwork | 0 | 0 | 0 |
| Final Exam | 1 | 34 | 34 |
| Other | 0 | 0 | 0 |
| Total Work Load: | 150 | ||
| Total Work Load / 30 | 5 | ||
| Course ECTS Credits: | 5 | ||
Course - Learning Outcomes Matrix
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Learning Outcomes | P3 | P5 | P7 |
|---|---|---|---|---|
| O1 | Knowledge of at least one structured programming language. | 4 | - | - |
| O2 | Designing computer engineering projects. | - | - | - |
| O3 | Ability to convey field knowledge in written and oral form | - | - | - |