COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 306FORMAL LANGUAGES & AUTOMATA THEORY3 + 06th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Compulsory
Course Objective Purpose of this course is to teach some topics (automatas, languages, grammer and turing machines) which are fundamentals of language theory. For computer scientists these topics are fundamental for complier design and description of computer languages. For mathematicians these topics has become important for group theory which is studying area under mathematic.
Course Content Finite automata theory: regular expressions, finite automata models, transation graphs, Kleene’s theory, basic descriptions, regular and irregular languages, Pumping Lemma and applications of finite automata. Push down automata theory: context free grammers and languages, parsing, push down automata models. Turing theory: design of turing machine, computation by turing machines.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to face

COURSE LEARNING OUTCOMES
1Understanding of basic concepts of course
2Understanding of finite automats
3Understanding of push down automats
4Understanding of languages hierarchy
5Understanding of Turing machines

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 0151154       
LO 0251154       
LO 0351154       
LO 0451154       
LO 0551154       
Sub Total25552520       
Contribution511540000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14342
Mid-terms11313
Final examination11313
Report / Project12020
Total Work Load

ECTS Credit of the Course






130

5

COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2020-2021 Spring1SEZAİ TOKAT

Course Details
Course Code:  CENG 306 Course Title:  FORMAL LANGUAGES & AUTOMATA THEORY
L+P Hour : 3 + 0   Course Code : 1   Language Of Instruction: Turkish Course Semester :  2020-2021 Spring
Course Coordinator :  PROFESSOR SEZAİ TOKAT E-Mail:  stokat@pau.edu.tr Phone Number : 
Course Location MUH A0254, MUH A0327,
Goals : Purpose of this course is to teach some topics (automatas, languages, grammer and turing machines) which are fundamentals of language theory. For computer scientists these topics are fundamental for complier design and description of computer languages. For mathematicians these topics has become important for group theory which is studying area under mathematic.
Content : Finite automata theory: regular expressions, finite automata models, transation graphs, Kleene’s theory, basic descriptions, regular and irregular languages, Pumping Lemma and applications of finite automata. Push down automata theory: context free grammers and languages, parsing, push down automata models. Turing theory: design of turing machine, computation by turing machines.
Attendance : %60
Topics
WeeksTopics
1 Sets, relations and functions,
2 alphabets and languages, finite representation of alphabets
3 Deterministic and non-deterministic finte automata
4 Non-deterministic finte automata
5 Deterministic and non-deterministic finte automata
6 Regular and non-regular languages, state minimization, Pumping Lemma
7 Regular and non-regular languages, state minimization, Pumping Lemma
8 Push Down Automata
9 MIDTERM
10 Context-free languages
11 Context-free languages
12 Turing Machine
13 Turing Machine, Church-Turing Thesis
14 Computational Complexity
Materials
Materials are not specified.
Resources
ResourcesResources Language
H.R. Lewis, C.H. Papadimitriou, Elements of the theory of computation, second edition, Prentice-Hall, 1998.Türkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes
© 2021 PAU