1.

Course file
Course Code CSU0031 Course Name Automata Theory
and Formal
Languages
Course Time Half academic year Course Tye !tional
Credits 3.0 Time er "ee# 3 hours
Course $rade Undergraduate Ad%anced
&lacement

Course 'ntroduction Automata theory in different modules for
analog and descri(e the hard"are and
soft"are systems) and descri(es the
descrition and nature of the %arious
languages) so that students understand
the structure of formal languages and
automata theory.
Course Target A(ility
1. *na(le students to understand other
formal languages) automata theory and
comuting related issues.
Undergraduate+
1,3 Familiar "ith data theory.
Sylla(us
&rofessor
Teaching rogress and toics
1 Introduction to the Theory of Computation
2 Finite Automata
3 Regular Languages and Regular Grammars
4 Properties of Regular Languages
5 Context-Free Grammar
6 Simplification of Context-Free Grammars
7 Pushdown Automata
8 Properties of Context-Free Languages
9 Turing Machines
10 Other Models of Turing Machines
11 A Hierarchy of Formal Languages and Automata
Teaching methods
-ode 'nstructions
Lecturing
Teaching &ro(lem Sol%ing
-edia into teaching
Scoring methods
-ode &ercentage 'nstructions
Home"or# ./0
-idterm *1am 3/0
Final *1am 3/0
Attend /0
2eference (oo#s An 'ntroduction to Formal Languages and
Automata) /th edition) (y &eter Lin3. 4ones and
5artlett 'nc.) .01.)