COMPUTER ENGINEERING | |||||
Bachelor | TR-NQF-HE: Level 6 | QF-EHEA: First Cycle | EQF-LLL: Level 6 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
CMP3008 | Formal Languages and Automata Theory | Spring | 3 | 0 | 3 | 6 |
The course opens with the approval of the Department at the beginning of each semester |
Language of instruction: | En |
Type of course: | Must Course |
Course Level: | Bachelor |
Mode of Delivery: | Face to face |
Course Coordinator : | Dr. Öğr. Üyesi TEVFİK AYTEKİN |
Course Objectives: | The course introduces basic formal languages and abstract computational models. The power and limitations of these languages and models will studied. Undecidable and NP-complete problems will be introduced. |
The students who have succeeded in this course; I. Be able to identify classes of formal languages, computational models and their relationships. II. Be able design regular expressions and finite state automata. III. Be able to convert Nondeterministic Finite Automata to Deterministic Finite Automata. IV. Be able to convert regular expressions to Nondeterministic Finite Automata. V. Be able to design grammars and push down automata VI. Be able to design Turing machines VII. Be able prove theorems in automata theory. VIII. Become familiar with undecidable and NP-complete problems and apply/report heuristic algorithms for solving NP-complete problems in a group project. |
Introduction, strings and languages, regular languages, finite automata, designing finite automata, nondeterminism, equivalence of NFAs and DFAs, regular Expressions, equivalence with finite automata, pumping lemma for regular languages, context-free Grammars, designing CFGs, Chomsky normal form, pushdown automata, equivalence with context-free grammars, non-context-free languages, Turing machines, examples of Turing machines, design of Turing machines, halting problem, undecidable problems, NP-complete problems. |
Week | Subject | Related Preparation | |
1) | Introduction, Strings, and Languages. | ||
2) | Finite Automata | ||
3) | Nondeterminism | ||
4) | Regular Expressions | ||
5) | Nonregular Languages | ||
6) | Context-Free Grammars | ||
7) | Pushdown Automata | ||
8) | Midterm Exam | ||
9) | Deterministic Context-Free Languages | ||
10) | Turing Machines. | ||
11) | Variants of Turing Machines | ||
12) | Undecidability | ||
13) | The Class P and The Class NP | ||
14) | NP-Completeness and Additional NP-Complete Problems | ||
14) | NP-Completeness and Additional NP-Complete Problems |
Course Notes: | Sipser, M. Introduction to the Theory of Computation, (3rd edition), 2012. |
References: | Yok - None |
Semester Requirements | Number of Activities | Level of Contribution |
Attendance | % 0 | |
Laboratory | % 0 | |
Application | % 0 | |
Field Work | % 0 | |
Special Course Internship (Work Placement) | % 0 | |
Quizzes | % 0 | |
Homework Assignments | % 0 | |
Presentation | % 0 | |
Project | 1 | % 20 |
Seminar | % 0 | |
Midterms | 1 | % 40 |
Preliminary Jury | % 0 | |
Final | 1 | % 40 |
Paper Submission | % 0 | |
Jury | % 0 | |
Bütünleme | % 0 | |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 40 | |
PERCENTAGE OF FINAL WORK | % 60 | |
Total | % 100 |
Activities | Number of Activities | Workload | |
Course Hours | 14 | 42 | |
Laboratory | |||
Application | |||
Special Course Internship (Work Placement) | |||
Field Work | |||
Study Hours Out of Class | |||
Presentations / Seminar | |||
Project | 5 | 30 | |
Homework Assignments | 11 | 33 | |
Quizzes | 4 | 8 | |
Preliminary Jury | |||
Midterms | 5 | 25 | |
Paper Submission | |||
Jury | |||
Final | 5 | 25 | |
Total Workload | 163 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution | |
1) | Adequate knowledge in mathematics, science and computer engineering; the ability to use theoretical and practical knowledge in these areas in complex engineering problems. | |
2) | Ability to identify, formulate, and solve complex engineering problems; ability to select and apply appropriate analysis and modeling methods for this purpose. | |
3) | Ability to design a complex system, process, device or product to meet specific requirements under realistic constraints and conditions; ability to apply modern design methods for this purpose. | |
4) | Ability to develop, select and use modern techniques and tools necessary for the analysis and solution of complex problems encountered in computer engineering applications; ability to use information technologies effectively. | |
5) | Ability to design, conduct experiments, collect data, analyze and interpret results for the study of complex engineering problems or computer engineering research topics. | |
6) | Ability to work effectively within and multi-disciplinary teams; individual study skills. | |
7) | Ability to communicate effectively in verbal and written Turkish; knowledge of at least one foreign language; ability to write active reports and understand written reports, to prepare design and production reports, to make effective presentations, to give and receive clear and understandable instructions. | |
8) | Awareness of the necessity of lifelong learning; ability to access information, to follow developments in science and technology and to renew continuously. | |
9) | To act in accordance with ethical principles, professional and ethical responsibility; information on the standards used in engineering applications. | |
10) | Information on business practices such as project management, risk management and change management; awareness of entrepreneurship and innovation; information about sustainable development. | |
11) | Knowledge of the effects of engineering practices on health, environment and safety in the universal and social scale and the problems of the era reflected in engineering; awareness of the legal consequences of engineering solutions. |