|
Week
|
Topics
|
Study Metarials
|
|
1
|
Introduction, Evidence Methods
|
R1-Chapter-1
|
|
2
|
Finite Automats
|
R1-Chapter-2
|
|
3
|
Regular Expressions
|
R1-Chapter-2
|
|
4
|
Properties of Regular Languages
|
R1-Chapter-2
|
|
5
|
Decision Properties of Regular Languages
|
R1-Chapter-3
|
|
6
|
Context-Free Grammars and Uncertainty
|
R1-Chapter-3
|
|
7
|
Push Automats
|
R1-Chapter-3
|
|
8
|
Push Vending Machines and Context-Free Grammars
|
R1-Chapter-4
|
|
9
|
Operations on Context-Free Grammars
|
R1-Chapter-4
|
|
10
|
Closedness Properties of Context-Free Grammars
|
R1-Chapter-4
|
|
11
|
Turing Machines and Complexity
|
R1-Chapter-4
|
|
12
|
Different Turing Machine Models
|
R1-Chapter-5
|
|
13
|
Decided and Non-Decided Problems
|
R1-Chapter-5,6
|
|
14
|
NP-Complete Problems
|
R1-Chapter-6
|
|
Prerequisites
|
-
|
|
Language of Instruction
|
Turkish
|
|
Responsible
|
Assist.Prof.Dr. Fuat TÜRK
|
|
Instructors
|
-
|
|
Assistants
|
-
|
|
Resources
|
1. Automata Theory, Languages and Computation, by John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. (Pearson 3rd Edition). 2.M. Sipser 2005, Introduction to the Theory of Computation, PWS Publ.3.Hopcroft J.E., Motwani R., Ullman J.D., Introduction to Automata Theory, Languages and Computation, 3/E, Addison Wesley, 2006.
|
|
Supplementary Book
|
-
|
|
Goals
|
to provide the necessary theoretical knowledge in order to design and analyze discrete systems.
|
|
Content
|
Introduction, Evidence Methods, Finite Automats, Regular Expressions, Properties of Regular Languages, Decision Properties of Regular Languages, Context-Free Grammars and Uncertainty, Push Automats, Push Vending Machines and Context-Free Grammars, Operations on Context-Free Grammars, Closedness Properties of Context-Free Grammars, Turing Machines and Complexity, Different Turing Machine Models, Decided and Non-Decided Problems, NP-Complete Problems
|
|
Program Learning Outcomes |
Level of Contribution |
|
1
|
To be able to apply mathematics, science and engineering theories and principles to Computer Engineering problems.
|
5
|
|
2
|
To have the ability to define, model, and solve problems related to Computer Engineering.
|
4
|
|
3
|
To be able to design and conduct experiments, as well as to analyze and interpret data.
|
3
|
|
4
|
To be able to design and analyze a process for a specific purpose within technical and economical limitations.
|
5
|
|
5
|
To be able to use modern techniques and calculation tools required for engineering applications.
|
4
|
|
6
|
To have the awareness of professional liabilities and ethics.
|
-
|
|
7
|
To be able to get involved in interdisciplined and multidisciplined team work.
|
-
|
|
8
|
To be able to declare his/her opinions orally or written in a clear, concise and brief manner.
|
-
|
|
9
|
To improve him/herself by following the developments in science, technology, modern issues, and know the importance of lifelong learning.
|
-
|
|
10
|
To be able to evaluate engineering solutions for the global and social problems especially for the health, safety, and environmental problems.
|
-
|
|
11
|
To have knowledge about of contemporary issues.
|
-
|