THEORY OF COMPUTATION
CT 502
Lecture : 3 year : II
Tutorial : 1
Part : I
Practical : 0
Course Objectives:
To provide basic understanding of theory of automata, formal languages, turing machines and computational complexity.
1. Introduction (4 hours)
1.1 Set, relation, function, Proof techniques.
1.2 Alphabets, language, regular expression.
2. Finite Automata (12 hours)
2.1 Deterministic Finite Automata.
2.2 Non-Deterministic Finite Automata.
2.3 Equivalence of regular language and finite automata.
2.4 Regular language, properties of regular language.
2.5 Pumping lemma for regular language.
2.6 Decision algorithms for regular languages.
