Skip to content

Automata Theory

Çorlu Faculty of EngineeringComputer Engineering (E.P.)

Code
BMB317
Term
2026-2027 Fall Semester
Theory
3
Prac.-Lab
0-0
Credit
3
AKTS
6
Course type
Required
Level
Bachelor
Language
Turkish
Category
Basic vocational courses
Prerequisites (recommended)
None
Lecturer
Academician Dr. BURCU DURMUŞ

Course objective

The aim of this course is to introduce the subject of automata and languages, which form the basis of formal language theory, to teach how the first computers worked, to break down large and complex problems into manageable ones, to abstract these problems, and to provide decision-making experience.

Learning outcomes

  1. LO-1Ability to improve problem solving ability.
  2. LO-2The ability to express concepts and solutions formally.
  3. LO-3To gain the ability of abstract thinking.
  4. LO-4To be able to comprehend the theoretical basis of sequential circuits involved in digital logic design.
  5. LO-5To be able to comprehend the theoretical basis of programming languages ​​and compilers.
  6. LO-6To be able to recognize the concrete applications of the basic models of computer theory in computer science.
  7. LO-7To be able to comprehend the basic models of computer theory.
  8. LO-8To be able to understand the importance of computer theory which constitutes the core of software and hardware systems.

Course content

Finite automata: deterministic and nondeterministic automata, inter-automata transformations, finite automata with output: Mealy and Moore machines, regular expressions and languages, context-free languages, pushdown automata, Turing machine, Chomsky hierarchy, theory of computation

Weekly topics

WeekTopicPreparation / method
1Introduction to Automata Theory
2Mathematical Notations and Terminology
3Deterministic Finite Automata (DFA)
4Nondeterministic Finite Automata (NFA)
5Transformations Between Finite Automata
6Finite Automata with Output: Mealy and Moore Machines
7Regular Expressions and Languages
8Context-Free Languages
9Midterm Exam
10Pushdown Automata
11Turing Machine
12Turing Machine Examples
13Chomsky Hierarchy
14Computation Theory
15Final Exam
16Final Exam

Sources and materials

Lecture notes
Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley & Sons Inc., Revised Edition.
Other sources
Özdevinirler (Otomatlar) Kuramı ve Biçimsel Diller, Prof. Dr. A. Ünal Yarımağan, Akademi Yayıncılık, 2011.
Documents
None
Assignments
None
Exams
None

Assessment

  • Ödev 1 %10
  • Arasınav 1 %30
  • Dönem Sonu Sınavı %60

Relation to programme outcomes

  1. PO-1A. Sufficient knowledge of subjects specific to mathematics, science and computer engineering discipline; the ability to use theoretical and applied knowledge in these areas to solve complex engineering problems specific to the computer engineering field.
  2. PO-2B. Ability to define, formulate and solve complex engineering problems related to the field of computer engineering; the ability to select and apply appropriate analysis and modeling methods for this purpose
  3. PO-3C. The ability to design a complex system, process or product under realistic constraints and conditions to meet specific requirements; the ability to apply modern design methods for these purposes.
  4. PO-4D. Ability to select and use modern techniques and tools required for analysis and solution of complex problems encountered in computer engineering applications; the ability to use information technologies effectively.
  5. PO-5E. Ability to design experiments, conduct experiments, collect data, analyze and interpret results to investigate complex problems or discipline-specific research topics encountered in the field of computer engineering.
  6. PO-6F. Ability to work effectively as a team member in intra-disciplinary and multi-disciplinary teams, ability to work individually.
  7. PO-7G. Ability to communicate effectively in oral and written form; Knowledge of at least one foreign language; the ability to write effective reports and understand written reports, to prepare design and production reports, to make effective presentations, to give and receive clear and understandable instructions.
  8. PO-8H. Awareness of the necessity of lifelong learning; the ability to access information, to follow developments in science and technology, and to constantly renew himself or herself.
  9. PO-9I. Information about compliance with ethical principles, professional and ethical responsibility and standards used in engineering practices.
  10. PO-10J. Information about business life practices such as project management, risk management and change management in the field of computer engineering; awareness of entrepreneurship, innovation; information about sustainable development.
  11. PO-11K. Information about global and social effects of computer engineering applications on health, environment and safety and current problems in engineering; awareness of the legal consequences of computer engineering solutions.
LO-1LO-2LO-3LO-4LO-5LO-6LO-7LO-8
PO-155555555
PO-255555555
PO-355555555
PO-444444444
PO-555555555
PO-633333333
PO-733333333
PO-833333333
PO-933333333
PO-1033333333
PO-1133333333

ECTS workload

ActivityCountHoursTotal
Out of class studying hours (prestudy, reinforcement)14570
Course duration(including the exam week: total course hours)16348
Final Exams13636
Midterm Exam 212626
Total workload180
Total workload / 306
ECTS credit6
Course form Open in new tab