Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Bachelors Level/Second Year/Fourth Semester/Science csit/fourth semester/theory of computation/syllabus

B.Sc Computer Science and Information Technology

Institute of Science and Technology, TU

Nature of the course: (Theory+Lab)

F.M: 60+20+20 P.M: 24+8+8

Credit Hrs: 3Hrs

Theory of Computation [CSC262]
Course Objective
i.
The main objective of the course is to introduce concepts of the models of computation and formal language approach to computation. The general objectives of this course are to, introduce concepts in automata theory and theory of computation, design different finite state machines and grammars and recognizers for different formal languages, identify different formal language classes and their relationships, determine the decidability and intractability of computational problems.
Course Description

This course presents a study of Finite State Machines and their languages. It covers the details of finite state automata, regular expressions, context free grammars. More, the course includes design of the Push-down automata and Turing Machines. The course also includes basics of undecidabilty and intractability

S1:Basic Foundations[3]
1
Review of Set Theory, Logic, Functions, Proofs
2
Automata, Computability and Complexity: Complexity Theory, Computability Theory, Automata Theory
3
Basic concepts of Automata Theory: Alphabets, Power of Alphabet, Kleen Closure Alphabet, Positive Closure of Alphabet, Strings, Empty String, Substring of a string, Concatenation of strings, Languages, Empty Language
S2:Introduction to Finite Automata[8]
1
Introduction to Finite Automata, Introduction of Finite State Machine
2
Deterministic Finite Automata (DFA), Notations for DFA, Language of DFA, Extended Transition Function of DFA Non-Deterministic Finite Automaton (NFA), Notations for NFA, Language of NFA, Extended Transition
3
Equivalence of DFA and NFA, Subset-Construction
4
Method for reduction of NFA to DFA, Theorems for equivalence of Language accepted by DFA and NFA
5
Finite Automaton with Epsilon Transition (ε - NFA), Notations for ε - NFA, Epsilon Closure of a State, Extended Transition Function of ε – NFA, Removing Epsilon Transition using the concept of Epsilon Closure, Equivalence of NFA and ε –NFA, Equivalence of DFA and ε – NFA
6
Finite State Machines with output: Moore machine and Mealy Machines
S3:Regular Expressions[6]
1
Regular Expressions, Regular Operators, Regular Languages and their applications, Algebraic Rules for Regular Expressions
2
Equivalence of Regular Expression and Finite Automata, Reduction of Regular Expression to ε – NFA, Conversion of DFA to Regular Expression
3
Properties of Regular Languages, Pumping Lemma, Application of Pumping Lemma, Closure Properties of Regular Languages over (Union, Intersection, Complement) Minimization of Finite State Machines: Table Filling Algorithm
S4:Context Free Grammar[9]
1
Introduction to Context Free Grammar (CFG), Components of CFG, Use of CFG, Context Free Language (CFL)
2
Types of derivations: Bottomup and Topdown approach, Leftmost and Rightmost, Language of a grammar
3
Parse tree and its construction, Ambiguous grammar, Use of parse tree to show ambiguity in grammar
4
Regular Grammars: Right Linear and Left Linear, Equivalence of regular grammar and finite automata
5
Simplification of CFG: Removal of Useless symbols, Nullable Symbols, and Unit Productions, Chomsky Normal Form (CNF), Greibach Normal Form (GNF), BackusNaur Form (BNF)
6
Context Sensitive Grammar, Chomsky Hierarchy Pumping Lemma for CFL, Application of Pumping Lemma, Closure Properties of CFL
S5:Push Down Automata[7]
1
Introduction to Push Down Automata (PDA), Representation of PDA, Operations of PDA, Move of a PDA, Instantaneous Description for PDA
2
Deterministic PDA, Non Deterministic PDA, Acceptance of strings by PDA, Language of PDA
3
Construction of PDA by Final State , Construction of PDA by Empty Stack
4
Conversion of PDA by Final State to PDA accepting by Empty Stack and vice-versa, Conversion of CFG to PDA, Conversion of PDA to CFG
S6:Turing Machines[10]
1
Introduction to Turing Machines (TM), Notations of Turing Machine, Language of a Turing Machine, Instantaneous Description for Turing Machine, Acceptance of a string by a Turing Machines
2
Turing Machine as a Language Recognizer, Turing Machine as a Computing Function, Turing Machine with Storage in its State, Turing Machine as a enumerator of stings of a language, Turing Machine as Subroutine
3
Turing Machine with Multiple Tracks, Turing Machine with Multiple Tapes, Equivalence of Multitape-TM and Multitrack-TM, Non-Deterministic Turing Machines, Restricted Turing Machines: With Semi-infinite Tape, Multistack Machines, Counter Machines
4
Curch Turing Thesis, Universal Turing Machine, Turing Machine and Computers, Encoding of Turing Machine, Enumerating Binary Strings, Codes of Turing Machine, Universal Turing Machine for encoding of Turing Machine
S7:Undecidability and Intractability[5]
1
Computational Complexity, Time and Space complexity of A Turing Machine, Intractability
2
Complexity Classes, Problem and its types: Absract, Decision, Optimization
3
Reducibility, Turing Reducible, Circuit Satisfiability, Cook’s Theorem,
4
Undecidability, Undecidable Problems: Post’s Correspondence Problem, Halting Problem and its proof, Undecidable Problem about Turing Machines
References
1.
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, 3 rd Edition, Pearson - Addison-Wesley
2.
Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation, 2nd Edition, Prentice Hall
3.
Michael Sipser, Introduction to the Theory of Computation, 3rd Edition, Thomson Course Technology
4.
Efim Kinber, Carl Smith, Theory of Computing: A Gentle introduction, Prentice- Hall
5.
John Martin, Introduction to Languages and the Theory of Computation, 3rd Edition, Tata McGraw Hill
6.
Kenneth H. Rosen, Discrete Mathematics and its Applications to Computers Science, WCB/Mc-Graw Hill
Labrotary Work
The laboratory work consists of design and implementation of finite state machines like DFA, NFA, PDA, and Turing Machine. Students are highly recommended to construct Tokenizers/ Lexers over/for some language. Students are advised to use regex and Perl (for using regular expressions), or any other higher level language for the laboratory works.