gs gs101 video lectures

gs gs101 - Automata Theory Video Lectures The book/course code gs gs101 Automata Theory belongs to gs organization and contains 114 in total video lectures. The students of Gegasoft organiztion can watch these video lecture on NVAEducation. These videos are also availble on Youtube and students can watch these video lectures of Automata Theory on Youtube, however, NVAEducation facilitates students to be able to download these video lectures without using any VPS or third-party tool.

List of video lectures of gs gs101

Here bellow is a list of 114 video lectures related to the course gs gs101 Automata Theory of organization Gegasoft (gs). To play a lecture choose a lecture from the list bellow.

Video Lectures of gs101 Automata Theory

#1 - Introduction to Theory of Computation

gs101 Automata Theory

#2 - Finite State Machine (Prerequisites)

gs101 Automata Theory

#3 - Finite State Machine (Finite Automata)

gs101 Automata Theory

#4 - Deterministic Finite Automata (Example 1)

gs101 Automata Theory

#5 - Deterministic Finite Automata (Example 2)

gs101 Automata Theory

#6 - Deterministic Finite Automata (Example 3)

gs101 Automata Theory

#7 - Deterministic Finite Automata (Example 4)

gs101 Automata Theory

#8 - Regular Languages

gs101 Automata Theory

#9 - Operations on Regular Languages

gs101 Automata Theory

#10 - Non-Deterministic Finite Automata

gs101 Automata Theory

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

gs101 Automata Theory

#12 - Non-Deterministic Finite Automata (Solved Example 1)

gs101 Automata Theory

#13 - Non-Deterministic Finite Automata (Solved Example 2)

gs101 Automata Theory

#14 - Non-Deterministic Finite Automata (Solved Example 3)

gs101 Automata Theory

#15 - Conversion of NFA to DFA

gs101 Automata Theory

#16 - Conversion of NFA to DFA (Example 1)

gs101 Automata Theory

#17 - Conversion of NFA to DFA (Example 2)

gs101 Automata Theory

#18 - Conversion of NFA to DFA (Example 3)

gs101 Automata Theory

#19 - Conversion of NFA to DFA (Example 4)

gs101 Automata Theory

#20 - Minimization of Deterministic Finite Automata (DFA)

gs101 Automata Theory

#21 - Minimization of DFA (Example 1)

gs101 Automata Theory

#22 - Minimization of DFA (Example 2)

gs101 Automata Theory

#23 - Minimization of DFA (With Multiple Final States)

gs101 Automata Theory

#24 - Minimization of DFA (With Unreachable States)

gs101 Automata Theory

#25 - Myhill Nerode Theorem - Table Filling Method

gs101 Automata Theory

#26 - Myhill Nerode Theorem - Table Filling Method (Example)

gs101 Automata Theory

#27 - Finite Automata With Outputs

gs101 Automata Theory

#28 - Construction of Mealy Machine

gs101 Automata Theory

#29 - Construction of Mealy Machine (Example 1)

gs101 Automata Theory

#30 - Construction of Mealy Machine (Example 2)

gs101 Automata Theory

#31 - Construction of Moore Machine

gs101 Automata Theory

#32 - Construction of Moore Machine (Example 1)

gs101 Automata Theory

#33 - Construction of Moore Machine (Example 2)

gs101 Automata Theory

#34 - Conversion of Moore Machine to Mealy Machine

gs101 Automata Theory

#35 - Conversion of Moore Machine to Mealy Machine (Example 1)

gs101 Automata Theory

#36 - Conversion of Moore Machine to Mealy Machine (Example 2)

gs101 Automata Theory

#37 - Conversion of Mealy Machine to Moore Machine

gs101 Automata Theory

#38 - Conversion of Mealy Machine to Moore Machine (Example 1)

gs101 Automata Theory

#39 - Conversion of Mealy Machine to Moore Machine (Example 2)

gs101 Automata Theory

#40 - Conversion of Mealy Machine to Moore Machine (Using Transition Table)

gs101 Automata Theory

#41 - Epsilon NFA

gs101 Automata Theory

#42 - Conversion of Epsilon NFA to NFA

gs101 Automata Theory

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

gs101 Automata Theory

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

gs101 Automata Theory

#45 - Regular Expression

gs101 Automata Theory

#46 - Regular Expression - Examples

gs101 Automata Theory

#47 - Identities of Regular Expression

gs101 Automata Theory

#48 - Arden’s Theorem

gs101 Automata Theory

#49 - An Example Proof using Identities of Regular Expressions

gs101 Automata Theory

#50 - Designing Regular Expressions

gs101 Automata Theory

#51 - NFA to Regular Expression Conversion

gs101 Automata Theory

#52 - DFA to Regular Expression Conversion

gs101 Automata Theory

#53 - DFA to Regular Expression Conversion (when the DFA has Multiple Final States)

gs101 Automata Theory

#54 - Conversion of Regular Expression to Finite Automata

gs101 Automata Theory

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

gs101 Automata Theory

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

gs101 Automata Theory

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

gs101 Automata Theory

#58 - Equivalence of Two Finite Automata

gs101 Automata Theory

#59 - Equivalence of Two Finite Automata (Example)

gs101 Automata Theory

#60 - Pumping Lemma (For Regular Languages)

gs101 Automata Theory

#61 - Pumping Lemma (For Regular Languages) | Example 1

gs101 Automata Theory

#62 - Pumping Lemma (For Regular Languages) | Example 2

gs101 Automata Theory

#63 - Regular Grammar

gs101 Automata Theory

#64 - Derivations from a Grammar

gs101 Automata Theory

#65 - Context Free Grammar & Context Free Language

gs101 Automata Theory

#66 - Regular Languages & Finite Automata (Solved Problem 1)

gs101 Automata Theory

#67 - Regular Languages & Finite Automata (Solved Problem 2)

gs101 Automata Theory

#68 - Regular Languages & Finite Automata (Solved Problem 3)

gs101 Automata Theory

#69 - Regular Languages & Finite Automata (Solved Problem 4)

gs101 Automata Theory

#70 - Regular Languages & Finite Automata (Solved Problem 5)

gs101 Automata Theory

#71 - Regular Languages & Finite Automata (Solved Problem 6)

gs101 Automata Theory

#72 - Method to find whether a String belongs to a Grammar or not

gs101 Automata Theory

#73 - Derivation Tree (Left & Right Derivation Trees)

gs101 Automata Theory

#74 - Ambiguous Grammar

gs101 Automata Theory

#75 - Simplification of CFG (Reduction of CFG)

gs101 Automata Theory

#76 - Simplification of CFG (Removal of Unit Productions)

gs101 Automata Theory

#77 - Simplification of CFG (Removal of Null Productions)

gs101 Automata Theory

#78 - Chomsky Normal Form & CFG to CNF Conversion

gs101 Automata Theory

#79 - Conversion of CFG to Chomsky Normal Form

gs101 Automata Theory

#80 - Greibach Normal Form & CFG to GNF Conversion

gs101 Automata Theory

#81 - CFG to GNF Conversion (Removal of Left Recursion)

gs101 Automata Theory

#82 - Pumping Lemma (For Context Free Languages)

gs101 Automata Theory

#83 - Pumping Lemma (For Context Free Languages) - Examples (Part 1)

gs101 Automata Theory

#84 - Pumping Lemma (For Context Free Languages) - Examples (Part 2)

gs101 Automata Theory

#85 - Pushdown Automata (Introduction)

gs101 Automata Theory

#86 - Pushdown Automata (Formal Definition)

gs101 Automata Theory

#87 - Pushdown Automata (Graphical Notation)

gs101 Automata Theory

#88 - Pushdown Automata Example - Even Palindrome (Part 1)

gs101 Automata Theory

#89 - Pushdown Automata Example - Even Palindrome (Part 2)

gs101 Automata Theory

#90 - Pushdown Automata Example - Even Palindrome (Part 3)

gs101 Automata Theory

#91 - Equivalence of CFG and PDA (Part 1)

gs101 Automata Theory

#92 - Equivalence of CFG and PDA (Part 2a)

gs101 Automata Theory

#93 - Equivalence of CFG and PDA (Part 2b)

gs101 Automata Theory

#94 - Turing Machine - Introduction (Part 1)

gs101 Automata Theory

#95 - Turing Machine - Introduction (Part 2)

gs101 Automata Theory

#96 - Turing Machine (Formal Definition)

gs101 Automata Theory

#97 - Turing Machine (Example 1)

gs101 Automata Theory

#98 - Turing Machine (Example 2)

gs101 Automata Theory

#99 - The Church-Turing Thesis

gs101 Automata Theory

#100 - Turing Machine for Even Palindromes

gs101 Automata Theory

#101 - Turing Machine Programming Techniques (Part 1)

gs101 Automata Theory

#102 - Turing Machine Programming Techniques (Part 2)

gs101 Automata Theory

#103 - Turing Machine Programming Techniques (Part 3)

gs101 Automata Theory

#104 - Multitape Turing Machine

gs101 Automata Theory

#105 - Nondeterministic Turing Machine (Part 1)

gs101 Automata Theory

#106 - Nondeterministic Turing Machine (Part 2)

gs101 Automata Theory

#107 - Turing Machine as Problem Solvers

gs101 Automata Theory

#108 - Decidability and Undecidability

gs101 Automata Theory

#109 - Universal Turing Machine

gs101 Automata Theory

#110 - The Halting Problem

gs101 Automata Theory

#111 - Undecidability of the Halting Problem

gs101 Automata Theory

#112 - The Post Correspondence Problem

gs101 Automata Theory

#113 - Undecidability of the Post Correspondence Problem

gs101 Automata Theory

#114 - TOC – Conclusion and Summary

gs101 Automata Theory