Theory of Computation & Automata Theory (English) (Part 1)

   Tuesday, April 23, 2024   

Starting a new Lecture Notes Series on Theory of Computation & Automata Theory

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Theory of Computation & Automata Theory By Lecture Notes together!

Lecture 1: Introduction to Theory of Computation

Lecture 2: Finite State Machine (Prerequisites)

Lecture 3: Finite State Machine (Finite Automata)

Lecture 4: Deterministic Finite Automata (Example 1)

Lecture 5: Deterministic Finite Automata (Example 2)

Lecture 6: Deterministic Finite Automata (Example 3)

Lecture 7: Deterministic Finite Automata (Example 4)

Lecture 8: Regular Languages

Lecture 9: Operations on Regular Languages

Lecture 10: Non-Deterministic Finite Automata

Lecture 11: Formal Definition of Non-Deterministic Finite Automata (NFA)

Lecture 12: Non-Deterministic Finite Automata (Solved Example 1)

Lecture 13: Non-Deterministic Finite Automata (Solved Example 2)

Lecture 14: Non-Deterministic Finite Automata (Solved Example 3)

Lecture 15: Conversion of NFA to DFA

Lecture 16: Conversion of NFA to DFA (Example 1)

Lecture 17: Conversion of NFA to DFA (Example 2)

Lecture 18: Conversion of NFA to DFA (Example 3)

Lecture 19: Conversion of NFA to DFA (Example 4)

Lecture 20: Minimization of Deterministic Finite Automata (DFA)

Lecture 21: Minimization of DFA (Example 1)

Lecture 22: Minimization of DFA (Example 2)

Lecture 23: Minimization of DFA (With Multiple Final States)

Lecture 24: Minimization of DFA (With Unreachable States)

Lecture 25: Myhill Nerode Theorem - Table Filling Method

Lecture 26: Myhill Nerode Theorem - Table Filling Method (Example)

Lecture 27: Finite Automata With Outputs

Lecture 28: Construction of Mealy Machine

Lecture 29: Construction of Mealy Machine (Example 1)

Lecture 30: Construction of Mealy Machine (Example 2)

Lecture 31: Construction of Moore Machine

Lecture 32: Construction of Moore Machine (Example 1)

Lecture 33: Construction of Moore Machine (Example 2)

Lecture 34: Conversion of Moore Machine to Mealy Machine

Lecture 35: Conversion of Moore Machine to Mealy Machine (Example 1)

Lecture 36: Conversion of Moore Machine to Mealy Machine (Example 2)

Lecture 37: Conversion of Mealy Machine to Moore Machine

Lecture 38: Conversion of Mealy Machine to Moore Machine (Example 1)

Lecture 39: Conversion of Mealy Machine to Moore Machine (Example 2)

Lecture 40: Conversion of Mealy Machine to Moore Machine (Using Transition Table)

Lecture 41: Epsilon NFA

Lecture 42: Conversion of Epsilon NFA to NFA

Lecture 43: Conversion of Epsilon NFA to NFA - Examples (Part 1)

Lecture 44: Conversion of Epsilon NFA to NFA - Examples (Part 2)

Lecture 45: Regular Expression

Lecture 46: Regular Expression - Examples

Lecture 47: Identities of Regular Expression

Lecture 48: Arden’s Theorem

Lecture 49: An Example Proof using Identities of Regular Expressions

Lecture 50: Designing Regular Expressions

Lecture 51: NFA to Regular Expression Conversion

Lecture 52: DFA to Regular Expression Conversion

Lecture 53: DFA to Regular Expression Conversion (when the DFA has Multiple Final States)

Lecture 54: Conversion of Regular Expression to Finite Automata

Lecture 55: Conversion of Regular Expression to Finite Automata - Examples (Part 1)

Lecture 56: Conversion of Regular Expression to Finite Automata - Examples (Part 2)

Lecture 57: Conversion of Regular Expression to Finite Automata - Examples (Part 3)