Ders Planı

ISTANBUL AYDIN UNIVERSITY

CLASS 1

CLASS 4

Lesson plan /

Lesson Information

Course Credit
Course ECTS Credit
Teaching Language of Instruction	İngilizce
Level of Course	Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course
Mode of Delivery	Face-to-face
Does the course require compulsory or optional work experience?
Course Coordinator
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course	Introduction to the Theory of Computation is a classical introduction to automata theory, formal grammars and complexity theory known collectively as the theory of computation.
Course Content	General Introduction: Languages, Grammars, Automata (Machines), The Chomsky Hierarchy, Applications. Finite State Machines, Regular Expressions, Regular Grammars, Nondeterminism, Non-regular sets, The Pumping Lemma, Decision Algorithms for Regular Sets

Learning Outcomes

Adequate knowledge in mathematics, physical sciences and the engineering subjects of individual branches; the ability to implement theoretical and practical knowledge in the respective areas to modeling and solving engineering problems.
Ability to identify, define, formulate and solve complex engineering problems; ability to select and implement the appropriate analysis and modeling methods in this respect.
Ability to design and conduct experiments for analyzing engineering problems or research subjects specific to the discipline, to collect data, to analyze and interpret the results.
Ability to use, choose and develop modern techniques and means required for engineering applications; ability to use information technologies effectively.
An ability to design and conduct experiments, collect data, analyze and interpret results for the study of complex engineering problems or discipline-specific research topics.
Awareness of the necessity of lifelong learning; ability to reach information, follow the latest developments in science and technology; ability to ensure self-renewal perpetually.
Acting in line with ethical principles, sense of professional and ethical responsibility; knowledge on the standards of engineering applications.
Ability to work effectively in interdisciplinary and multi-disciplinary teams and individual works.
Information about the effects of engineering applications on health, environment and safety in terms of universal and social aspects and information about the problems of the era; awareness about the legal results of engineering solutions.
Ability to communicate efficiently both in oral and written ways in Turkish; knowledge of at least one foreign language; ability to effectively prepare reports and understand written reports, prepare design and production reports, effective presentation, giving and receiving clear and understandable instructions.
Knowledge of business practices such as project management, risk management and change management; awareness of entrepreneurship, innovation; information about sustainable development.

Weekly Course Subjects

1	Finite State Machines, Design, Non-Determinism
2	Closure Properties, Regular Expressions, Equivalence with Finite State Machines.
3	The Pumping Lemma – Proving a Language is Non-Regular, The Adversary Game, Using Closure Properties.
4	Regular Grammars, Equivalence to FSMs, Other FSM Variations, Minimization of FSM’s.
5	Decision Algorithms for Regular Sets and Undecidability
6	Context-Free Grammars, Semantic and Inductive Design, Examples, Applications.
7	Chomsky Normal Form. Three Applications.
8	Midterm
9	Pushdown Machines, Non-Determinism Adds Power, Equivalence to CFG’s.
10	The Pumping Lemma and Non-Context-Free Sets.
11	Closure Properties, DCFL’s and Decision Algorithms.
12	Turing Machines, Design.
13	Variations and Equivalence: Non-Determinism, MultiTape, Two-Way.
14	Recursive and Recursively Enumerable Sets, Undecidability.

Resources

1-1-Introduction to the Theory of Computation, Michael Sipser.

EUA Kurumsal Öz değerlendirme Programı İzleme Raporu