|
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
|