Theory Of Automata VU Lectures PPT, Pdf|CS 402

Theory of automata VU lectures in PPT and Pdf course code 402. 45 lectures on the theory of automata highlighted handouts with ppt slides. Following topics with explanatory notes and slides are given below. All lecturers have arranged the Virtual University of Pakistan. Each topic is with definitions and different methods of explanation.

Theory of Automata Lecture NO. 1

Topic 1 is the introduction to the theory of atomata. Basic methods and types of expressions are given below.

• Regular Expression
• Recursive definition of Regular Expression(RE)
• Method 3 (Regxilar Expressions)
• Equivalent Regular Expressions
• Method 4 (Finite Automaton)

Lecture No:2

• Kleene Star Closure
• Recursive definition of languages

Lecture No:3

• Regular Expression
• Recursive definition of Regular Expression(RE)
• Method 3 (Regular Expressions)

Lecture No:4

• Equivalent Regular Expressions
• Method 4 (Finite Automaton)
• Lecture N0. 5
• Lecture N0. 6
• Equivalent FAs
• Lecture N0. 7
• FA corresponding to finite languages
• Method 5 (Transition Graph)
• Lecture N0. 8
• Examples of TGs: accepting all strings, accepting none, starting with b, not ending in b,
• containing aa, containing aa or bb
• Lecture N0. 9
• Generalized Transition Graphs
• Lecture N0. 10
• Nondeterminism
• Kleeneâ€™s Theorem
• Lecture N0. 11
• Proof(Kleeneâ€™s Theorem Part II)
• Lecture N0. 12
• Kleeneâ€™s Theorem Part III
• Lecture N0. 13
• Lecture N0. 14
• Lecture N0. 15
• Nondeterministic Finite Automaton (NFA)
• Converting an FA to an equivalent NFA
• Lecture N0. 16
• NFA with Null String
• Lecture N0. 17
• NFA and Kleeneâ€™s Theorem
• Lecture N0. 18
• NFA corresponding to Concatenation of FAs
• NFA corresponding to the Closure of an FA

Lecture N0. 19
Memory required to recognize a language
Distinguishable strings and Indistinguishable strings
Lecture N0. 20
Finite Automaton with output
Moore machine
Lecture N0. 21
Mealy machine
Lecture N0. 22
Equivalent machines
Lecture N0. 23