Spread Knowledge

Theory of Automata - CS402 - VU Video Lectures

View Video
3179 Views
Rated 3
What Does Automata Mean?, Introduction To Languages, Alphabets, Strings, Defining Languages.
View Video
1639 Views
Rated 3
Kleene Star Closure, Recursive Definition Of Languages.
View Video
1796 Views
Rated 3
Regular Expression, Recursive Definition Of Regular Expression(RE), Method 3 (Regular Expressions).
View Video
1234 Views
Rated 3
Equivalent Regular Expressions, Method 4 (Finite Automaton).
View Video
939 Views
Rated 3
Introduction To Computer Theory, Transitions.
View Video
924 Views
Rated 3
Equivalent Fas.
View Video
865 Views
Rated 3
Fa Corresponding To Finite Languages, Method 5 (Transition Graph).
View Video
735 Views
Rated 3
Accepting All Strings, Accepting None, Starting With B, Not Ending In B,Containing Aa, Containing Aa Or Bb.
View Video
805 Views
Rated 3
Generalized Transition Graphs.
View Video
814 Views
Rated 3
Nondeterminism, Kleene’s Theorem.
View Video
812 Views
Rated 3
Proof(Kleene’s Theorem Part Ii).
View Video
735 Views
Rated 3
Kleene’s Theorem Part Iii.
View Video
926 Views
Rated 2
Method2 (Concatenation Of Two Fas).
View Video
653 Views
Rated 3
Method3: (Closure Of An Fa).
View Video
664 Views
Rated 3
Nondeterministic Finite Automaton (Nfa), Converting An Fa To An Equivalent Nfa.
View Video
713 Views
Rated 3
NFA With Null String.
View Video
627 Views
Rated 3
NFA And Kleene’s Theorem.
View Video
668 Views
Rated 3
NFA Corresponding To Concatenation Of Fas, NFA Corresponding To The Closure Of An FA.
View Video
591 Views
Rated 3
Memory Required To Recognize A Language, Distinguishable Strings And Indistinguishable Strings.
View Video
859 Views
Rated 3
Finite Automaton With Output, Moore Machine.
View Video
727 Views
Rated 3
Mealy Machine.
View Video
583 Views
Rated 3
Equivalent Machines.
View Video
766 Views
Rated 3
Nand Box (Not And), Delay Box (Flip Flop Box).
View Video
674 Views
Rated 3
Regular Languages, Complement Of A Language.
View Video
658 Views
Rated 3
Nonregular Languages.
View Video
698 Views
Rated 3
Pumping Lemma.
View Video
660 Views
Rated 3
Pumping Lemma version II.
View Video
564 Views
Rated 3
Pseudo Theorem.
View Video
626 Views
Rated 3
Decidability.
View Video
1306 Views
Rated 3
Context Free Grammar (CFG), CFG Terminologies.
View Video
872 Views
Rated 3
Polish Notation (O-O-O).
View Video
812 Views
Rated 3
Total Language Tree, Regular Grammar.
View Video
686 Views
Rated 3
Null Production.
View Video
781 Views
Rated 3
Chomsky Normal Form (CNF).
View Video
820 Views
Rated 3
A New Format For Fas.
View Video
717 Views
Rated 3
Nondeterministic PDA.
View Video
687 Views
Rated 3
PDA Corresponding To CFG.
View Video
696 Views
Rated 3
Conversion Form Of PDA.
View Video
524 Views
Rated 3
Conversion Form Of PDA.
View Video
604 Views
Rated 3
Conversion Form Of PDA.
View Video
574 Views
Rated 3
Non-Context-Free Language, Pumping Lemma For Cfls.
View Video
573 Views
Rated 3
Decidablity, Parsing Techniques.
View Video
856 Views
Rated 3
Turing Machine.